Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,204; 200,000,000,136) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,204 = 22 × 1,901 × 13,151
100,000,204 is not a prime number but a composite one.
200,000,000,136 = 23 × 3 × 8,333,333,339
200,000,000,136 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,136 ÷ 100,000,204 = 1,999 + 99,592,340
Step 2. Divide the smaller number by the above operation's remainder:
100,000,204 ÷ 99,592,340 = 1 + 407,864
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,592,340 ÷ 407,864 = 244 + 73,524
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
407,864 ÷ 73,524 = 5 + 40,244
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
73,524 ÷ 40,244 = 1 + 33,280
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
40,244 ÷ 33,280 = 1 + 6,964
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
33,280 ÷ 6,964 = 4 + 5,424
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,964 ÷ 5,424 = 1 + 1,540
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
5,424 ÷ 1,540 = 3 + 804
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,540 ÷ 804 = 1 + 736
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
804 ÷ 736 = 1 + 68
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
736 ÷ 68 = 10 + 56
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
68 ÷ 56 = 1 + 12
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
56 ÷ 12 = 4 + 8
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
12 ÷ 8 = 1 + 4
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
8 ÷ 4 = 2 + 0
At this step, the remainder is zero, so we stop:
4 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,204; 200,000,000,136) = 4 = 22
The two numbers have common prime factors