Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,110; 200,000,001,356) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,110 = 2 × 3 × 5 × 7 × 31 × 15,361
100,000,110 is not a prime number but a composite one.
200,000,001,356 = 22 × 173 × 1,607 × 179,849
200,000,001,356 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,356 ÷ 100,000,110 = 1,999 + 99,781,466
Step 2. Divide the smaller number by the above operation's remainder:
100,000,110 ÷ 99,781,466 = 1 + 218,644
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,781,466 ÷ 218,644 = 456 + 79,802
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
218,644 ÷ 79,802 = 2 + 59,040
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
79,802 ÷ 59,040 = 1 + 20,762
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
59,040 ÷ 20,762 = 2 + 17,516
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
20,762 ÷ 17,516 = 1 + 3,246
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
17,516 ÷ 3,246 = 5 + 1,286
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,246 ÷ 1,286 = 2 + 674
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,286 ÷ 674 = 1 + 612
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
674 ÷ 612 = 1 + 62
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
612 ÷ 62 = 9 + 54
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
62 ÷ 54 = 1 + 8
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
54 ÷ 8 = 6 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
8 ÷ 6 = 1 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
6 ÷ 2 = 3 + 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,110; 200,000,001,356) = 2
The two numbers have common prime factors