Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,146; 200,000,000,625) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,146 = 2 × 3 × 587 × 28,393
100,000,146 is not a prime number but a composite one.
200,000,000,625 = 3 × 54 × 3,061 × 34,847
200,000,000,625 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,000,625 ÷ 100,000,146 = 1,999 + 99,708,771
Step 2. Divide the smaller number by the above operation's remainder:
100,000,146 ÷ 99,708,771 = 1 + 291,375
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,708,771 ÷ 291,375 = 342 + 58,521
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
291,375 ÷ 58,521 = 4 + 57,291
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
58,521 ÷ 57,291 = 1 + 1,230
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
57,291 ÷ 1,230 = 46 + 711
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,230 ÷ 711 = 1 + 519
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
711 ÷ 519 = 1 + 192
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
519 ÷ 192 = 2 + 135
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
192 ÷ 135 = 1 + 57
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
135 ÷ 57 = 2 + 21
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
57 ÷ 21 = 2 + 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,146; 200,000,000,625) = 3
The two numbers have common prime factors