Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,122; 200,000,001,207) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,122 = 2 × 3 × 37 × 450,451
100,000,122 is not a prime number but a composite one.
200,000,001,207 = 3 × 19 × 563 × 6,232,277
200,000,001,207 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,207 ÷ 100,000,122 = 1,999 + 99,757,329
Step 2. Divide the smaller number by the above operation's remainder:
100,000,122 ÷ 99,757,329 = 1 + 242,793
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,757,329 ÷ 242,793 = 410 + 212,199
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
242,793 ÷ 212,199 = 1 + 30,594
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
212,199 ÷ 30,594 = 6 + 28,635
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
30,594 ÷ 28,635 = 1 + 1,959
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
28,635 ÷ 1,959 = 14 + 1,209
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,959 ÷ 1,209 = 1 + 750
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,209 ÷ 750 = 1 + 459
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
750 ÷ 459 = 1 + 291
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
459 ÷ 291 = 1 + 168
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
291 ÷ 168 = 1 + 123
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
168 ÷ 123 = 1 + 45
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
123 ÷ 45 = 2 + 33
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
45 ÷ 33 = 1 + 12
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
33 ÷ 12 = 2 + 9
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
12 ÷ 9 = 1 + 3
Step 18. Divide the remainder of the step 16 by the remainder of the step 17:
9 ÷ 3 = 3 + 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,122; 200,000,001,207) = 3
The two numbers have common prime factors