Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,017; 200,000,001,027) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,017 = 32 × 13 × 31 × 79 × 349
100,000,017 is not a prime number but a composite one.
200,000,001,027 = 3 × 42,863 × 1,555,343
200,000,001,027 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,027 ÷ 100,000,017 = 1,999 + 99,967,044
Step 2. Divide the smaller number by the above operation's remainder:
100,000,017 ÷ 99,967,044 = 1 + 32,973
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,967,044 ÷ 32,973 = 3,031 + 25,881
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
32,973 ÷ 25,881 = 1 + 7,092
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
25,881 ÷ 7,092 = 3 + 4,605
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
7,092 ÷ 4,605 = 1 + 2,487
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,605 ÷ 2,487 = 1 + 2,118
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,487 ÷ 2,118 = 1 + 369
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,118 ÷ 369 = 5 + 273
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
369 ÷ 273 = 1 + 96
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
273 ÷ 96 = 2 + 81
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
96 ÷ 81 = 1 + 15
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
81 ÷ 15 = 5 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
15 ÷ 6 = 2 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 3 = 2 + 0
At this step, the remainder is zero, so we stop:
3 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,017; 200,000,001,027) = 3
The two numbers have common prime factors