Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,108; 200,000,000,426) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,108 = 22 × 13 × 1,923,079
100,000,108 is not a prime number but a composite one.
200,000,000,426 = 2 × 47 × 1,303 × 1,632,893
200,000,000,426 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,426 ÷ 100,000,108 = 1,999 + 99,784,534
Step 2. Divide the smaller number by the above operation's remainder:
100,000,108 ÷ 99,784,534 = 1 + 215,574
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,784,534 ÷ 215,574 = 462 + 189,346
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
215,574 ÷ 189,346 = 1 + 26,228
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
189,346 ÷ 26,228 = 7 + 5,750
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
26,228 ÷ 5,750 = 4 + 3,228
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
5,750 ÷ 3,228 = 1 + 2,522
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,228 ÷ 2,522 = 1 + 706
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,522 ÷ 706 = 3 + 404
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
706 ÷ 404 = 1 + 302
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
404 ÷ 302 = 1 + 102
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
302 ÷ 102 = 2 + 98
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
102 ÷ 98 = 1 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
98 ÷ 4 = 24 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
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,108; 200,000,000,426) = 2
The two numbers have common prime factors