Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,126; 200,000,000,372) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,126 = 2 × 50,000,063
100,000,126 is not a prime number but a composite one.
200,000,000,372 = 22 × 74,159 × 674,227
200,000,000,372 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,372 ÷ 100,000,126 = 1,999 + 99,748,498
Step 2. Divide the smaller number by the above operation's remainder:
100,000,126 ÷ 99,748,498 = 1 + 251,628
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,748,498 ÷ 251,628 = 396 + 103,810
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
251,628 ÷ 103,810 = 2 + 44,008
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
103,810 ÷ 44,008 = 2 + 15,794
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
44,008 ÷ 15,794 = 2 + 12,420
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
15,794 ÷ 12,420 = 1 + 3,374
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
12,420 ÷ 3,374 = 3 + 2,298
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,374 ÷ 2,298 = 1 + 1,076
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,298 ÷ 1,076 = 2 + 146
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,076 ÷ 146 = 7 + 54
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
146 ÷ 54 = 2 + 38
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
54 ÷ 38 = 1 + 16
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
38 ÷ 16 = 2 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
16 ÷ 6 = 2 + 4
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
6 ÷ 4 = 1 + 2
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
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,126; 200,000,000,372) = 2
The two numbers have common prime factors