Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,125; 200,000,001,327) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,125 = 32 × 53 × 103 × 863
100,000,125 is not a prime number but a composite one.
200,000,001,327 = 3 × 7 × 9,949 × 957,263
200,000,001,327 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,327 ÷ 100,000,125 = 1,999 + 99,751,452
Step 2. Divide the smaller number by the above operation's remainder:
100,000,125 ÷ 99,751,452 = 1 + 248,673
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,751,452 ÷ 248,673 = 401 + 33,579
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
248,673 ÷ 33,579 = 7 + 13,620
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
33,579 ÷ 13,620 = 2 + 6,339
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
13,620 ÷ 6,339 = 2 + 942
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
6,339 ÷ 942 = 6 + 687
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
942 ÷ 687 = 1 + 255
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
687 ÷ 255 = 2 + 177
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
255 ÷ 177 = 1 + 78
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
177 ÷ 78 = 2 + 21
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
78 ÷ 21 = 3 + 15
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
21 ÷ 15 = 1 + 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,125; 200,000,001,327) = 3
The two numbers have common prime factors