Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,112; 200,000,001,054) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,112 = 24 × 43 × 145,349
100,000,112 is not a prime number but a composite one.
200,000,001,054 = 2 × 3 × 7 × 4,761,904,787
200,000,001,054 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,001,054 ÷ 100,000,112 = 1,999 + 99,777,166
Step 2. Divide the smaller number by the above operation's remainder:
100,000,112 ÷ 99,777,166 = 1 + 222,946
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,777,166 ÷ 222,946 = 447 + 120,304
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
222,946 ÷ 120,304 = 1 + 102,642
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
120,304 ÷ 102,642 = 1 + 17,662
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
102,642 ÷ 17,662 = 5 + 14,332
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
17,662 ÷ 14,332 = 1 + 3,330
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
14,332 ÷ 3,330 = 4 + 1,012
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,330 ÷ 1,012 = 3 + 294
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,012 ÷ 294 = 3 + 130
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
294 ÷ 130 = 2 + 34
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
130 ÷ 34 = 3 + 28
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
34 ÷ 28 = 1 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
28 ÷ 6 = 4 + 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,112; 200,000,001,054) = 2
The two numbers have common prime factors