Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,210; 200,000,001,354) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,210 = 2 × 5 × 97 × 103,093
100,000,210 is not a prime number but a composite one.
200,000,001,354 = 2 × 3 × 17 × 37 × 257 × 206,203
200,000,001,354 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,354 ÷ 100,000,210 = 1,999 + 99,581,564
Step 2. Divide the smaller number by the above operation's remainder:
100,000,210 ÷ 99,581,564 = 1 + 418,646
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,581,564 ÷ 418,646 = 237 + 362,462
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
418,646 ÷ 362,462 = 1 + 56,184
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
362,462 ÷ 56,184 = 6 + 25,358
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
56,184 ÷ 25,358 = 2 + 5,468
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
25,358 ÷ 5,468 = 4 + 3,486
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,468 ÷ 3,486 = 1 + 1,982
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,486 ÷ 1,982 = 1 + 1,504
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,982 ÷ 1,504 = 1 + 478
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,504 ÷ 478 = 3 + 70
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
478 ÷ 70 = 6 + 58
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
70 ÷ 58 = 1 + 12
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
58 ÷ 12 = 4 + 10
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
12 ÷ 10 = 1 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
10 ÷ 2 = 5 + 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,210; 200,000,001,354) = 2
The two numbers have common prime factors