Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,246; 200,000,000,700) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,246 = 2 × 5,087 × 9,829
100,000,246 is not a prime number but a composite one.
200,000,000,700 = 22 × 32 × 52 × 449 × 494,927
200,000,000,700 is not a prime number but a composite one.
- Prime number: a natural number that is only divisible by 1 and itself. A prime number has exactly two factors: 1 and itself.
- Composite number: a natural number that has at least one other factor than 1 and itself.
Calculate the greatest (highest) common factor (divisor):
Multiply all the common prime factors, taken by their smallest exponents (the smallest powers).
Step 1. Divide the larger number by the smaller one:
200,000,000,700 ÷ 100,000,246 = 1,999 + 99,508,946
Step 2. Divide the smaller number by the above operation's remainder:
100,000,246 ÷ 99,508,946 = 1 + 491,300
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,508,946 ÷ 491,300 = 202 + 266,346
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
491,300 ÷ 266,346 = 1 + 224,954
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
266,346 ÷ 224,954 = 1 + 41,392
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
224,954 ÷ 41,392 = 5 + 17,994
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
41,392 ÷ 17,994 = 2 + 5,404
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
17,994 ÷ 5,404 = 3 + 1,782
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
5,404 ÷ 1,782 = 3 + 58
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,782 ÷ 58 = 30 + 42
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
58 ÷ 42 = 1 + 16
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
42 ÷ 16 = 2 + 10
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
16 ÷ 10 = 1 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
10 ÷ 6 = 1 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 4 = 1 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
4 ÷ 2 = 2 + 0
At this step, the remainder is zero, so we stop:
2 is the number we were looking for - the last non-zero remainder.
This is the greatest (highest) common factor (divisor).
The greatest (highest) common factor (divisor):
gcf, hcf, gcd (100,000,246; 200,000,000,700) = 2
The two numbers have common prime factors