Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,128; 200,000,000,685) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,128 = 27 × 3 × 260,417
100,000,128 is not a prime number but a composite one.
200,000,000,685 = 3 × 5 × 127 × 5,417 × 19,381
200,000,000,685 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,685 ÷ 100,000,128 = 1,999 + 99,744,813
Step 2. Divide the smaller number by the above operation's remainder:
100,000,128 ÷ 99,744,813 = 1 + 255,315
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,744,813 ÷ 255,315 = 390 + 171,963
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
255,315 ÷ 171,963 = 1 + 83,352
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
171,963 ÷ 83,352 = 2 + 5,259
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
83,352 ÷ 5,259 = 15 + 4,467
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
5,259 ÷ 4,467 = 1 + 792
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4,467 ÷ 792 = 5 + 507
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
792 ÷ 507 = 1 + 285
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
507 ÷ 285 = 1 + 222
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
285 ÷ 222 = 1 + 63
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
222 ÷ 63 = 3 + 33
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
63 ÷ 33 = 1 + 30
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
33 ÷ 30 = 1 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
30 ÷ 3 = 10 + 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,128; 200,000,000,685) = 3
The two numbers have common prime factors