Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,018; 200,000,000,332) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,018 = 2 × 17 × 1,451 × 2,027
100,000,018 is not a prime number but a composite one.
200,000,000,332 = 22 × 11 × 47 × 96,711,799
200,000,000,332 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,332 ÷ 100,000,018 = 1,999 + 99,964,350
Step 2. Divide the smaller number by the above operation's remainder:
100,000,018 ÷ 99,964,350 = 1 + 35,668
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,964,350 ÷ 35,668 = 2,802 + 22,614
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
35,668 ÷ 22,614 = 1 + 13,054
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
22,614 ÷ 13,054 = 1 + 9,560
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
13,054 ÷ 9,560 = 1 + 3,494
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,560 ÷ 3,494 = 2 + 2,572
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,494 ÷ 2,572 = 1 + 922
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,572 ÷ 922 = 2 + 728
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
922 ÷ 728 = 1 + 194
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
728 ÷ 194 = 3 + 146
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
194 ÷ 146 = 1 + 48
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
146 ÷ 48 = 3 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
48 ÷ 2 = 24 + 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,018; 200,000,000,332) = 2
The two numbers have common prime factors