Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,140; 200,000,000,751) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,140 = 22 × 3 × 5 × 179 × 9,311
100,000,140 is not a prime number but a composite one.
200,000,000,751 = 3 × 19 × 3,508,771,943
200,000,000,751 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,751 ÷ 100,000,140 = 1,999 + 99,720,891
Step 2. Divide the smaller number by the above operation's remainder:
100,000,140 ÷ 99,720,891 = 1 + 279,249
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,720,891 ÷ 279,249 = 357 + 28,998
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
279,249 ÷ 28,998 = 9 + 18,267
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
28,998 ÷ 18,267 = 1 + 10,731
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
18,267 ÷ 10,731 = 1 + 7,536
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
10,731 ÷ 7,536 = 1 + 3,195
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
7,536 ÷ 3,195 = 2 + 1,146
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,195 ÷ 1,146 = 2 + 903
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,146 ÷ 903 = 1 + 243
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
903 ÷ 243 = 3 + 174
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
243 ÷ 174 = 1 + 69
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
174 ÷ 69 = 2 + 36
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
69 ÷ 36 = 1 + 33
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
36 ÷ 33 = 1 + 3
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
33 ÷ 3 = 11 + 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,140; 200,000,000,751) = 3
The two numbers have common prime factors