Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,143; 200,000,001,027) = ?
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,001,027 = 3 × 42,863 × 1,555,343
200,000,001,027 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,027 ÷ 100,000,143 = 1,999 + 99,715,170
Step 2. Divide the smaller number by the above operation's remainder:
100,000,143 ÷ 99,715,170 = 1 + 284,973
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,715,170 ÷ 284,973 = 349 + 259,593
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
284,973 ÷ 259,593 = 1 + 25,380
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
259,593 ÷ 25,380 = 10 + 5,793
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
25,380 ÷ 5,793 = 4 + 2,208
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
5,793 ÷ 2,208 = 2 + 1,377
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,208 ÷ 1,377 = 1 + 831
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,377 ÷ 831 = 1 + 546
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
831 ÷ 546 = 1 + 285
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
546 ÷ 285 = 1 + 261
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
285 ÷ 261 = 1 + 24
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
261 ÷ 24 = 10 + 21
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
24 ÷ 21 = 1 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
21 ÷ 3 = 7 + 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,001,027) = 3
The two numbers have common prime factors