Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,143; 200,000,000,670) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,143 = 33 × 83 × 44,623
100,000,143 is not a prime number but a composite one.
200,000,000,670 = 2 × 3 × 5 × 9,311 × 715,999
200,000,000,670 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,670 ÷ 100,000,143 = 1,999 + 99,714,813
Step 2. Divide the smaller number by the above operation's remainder:
100,000,143 ÷ 99,714,813 = 1 + 285,330
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,714,813 ÷ 285,330 = 349 + 134,643
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
285,330 ÷ 134,643 = 2 + 16,044
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
134,643 ÷ 16,044 = 8 + 6,291
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
16,044 ÷ 6,291 = 2 + 3,462
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
6,291 ÷ 3,462 = 1 + 2,829
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,462 ÷ 2,829 = 1 + 633
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,829 ÷ 633 = 4 + 297
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
633 ÷ 297 = 2 + 39
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
297 ÷ 39 = 7 + 24
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
39 ÷ 24 = 1 + 15
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
24 ÷ 15 = 1 + 9
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
15 ÷ 9 = 1 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
9 ÷ 6 = 1 + 3
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
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,143; 200,000,000,670) = 3
The two numbers have common prime factors