Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,108; 200,000,001,201) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,108 = 22 × 13 × 1,923,079
100,000,108 is not a prime number but a composite one.
200,000,001,201 = 3 × 7 × 11 × 13 × 17 × 619 × 6,329
200,000,001,201 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,201 ÷ 100,000,108 = 1,999 + 99,785,309
Step 2. Divide the smaller number by the above operation's remainder:
100,000,108 ÷ 99,785,309 = 1 + 214,799
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,785,309 ÷ 214,799 = 464 + 118,573
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
214,799 ÷ 118,573 = 1 + 96,226
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
118,573 ÷ 96,226 = 1 + 22,347
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
96,226 ÷ 22,347 = 4 + 6,838
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
22,347 ÷ 6,838 = 3 + 1,833
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,838 ÷ 1,833 = 3 + 1,339
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,833 ÷ 1,339 = 1 + 494
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,339 ÷ 494 = 2 + 351
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
494 ÷ 351 = 1 + 143
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
351 ÷ 143 = 2 + 65
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
143 ÷ 65 = 2 + 13
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
65 ÷ 13 = 5 + 0
At this step, the remainder is zero, so we stop:
13 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,108; 200,000,001,201) = 13
The two numbers have common prime factors