Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,106; 200,000,000,252) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,106 = 2 × 61 × 819,673
100,000,106 is not a prime number but a composite one.
200,000,000,252 = 22 × 13 × 71 × 54,171,181
200,000,000,252 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,252 ÷ 100,000,106 = 1,999 + 99,788,358
Step 2. Divide the smaller number by the above operation's remainder:
100,000,106 ÷ 99,788,358 = 1 + 211,748
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,788,358 ÷ 211,748 = 471 + 55,050
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
211,748 ÷ 55,050 = 3 + 46,598
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
55,050 ÷ 46,598 = 1 + 8,452
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
46,598 ÷ 8,452 = 5 + 4,338
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
8,452 ÷ 4,338 = 1 + 4,114
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4,338 ÷ 4,114 = 1 + 224
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,114 ÷ 224 = 18 + 82
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
224 ÷ 82 = 2 + 60
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
82 ÷ 60 = 1 + 22
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
60 ÷ 22 = 2 + 16
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
22 ÷ 16 = 1 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
16 ÷ 6 = 2 + 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,106; 200,000,000,252) = 2
The two numbers have common prime factors