Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,128; 200,000,000,307) = ?
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,307 = 3 × 337 × 977 × 202,481
200,000,000,307 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,307 ÷ 100,000,128 = 1,999 + 99,744,435
Step 2. Divide the smaller number by the above operation's remainder:
100,000,128 ÷ 99,744,435 = 1 + 255,693
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,744,435 ÷ 255,693 = 390 + 24,165
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
255,693 ÷ 24,165 = 10 + 14,043
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
24,165 ÷ 14,043 = 1 + 10,122
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
14,043 ÷ 10,122 = 1 + 3,921
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
10,122 ÷ 3,921 = 2 + 2,280
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,921 ÷ 2,280 = 1 + 1,641
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,280 ÷ 1,641 = 1 + 639
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,641 ÷ 639 = 2 + 363
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
639 ÷ 363 = 1 + 276
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
363 ÷ 276 = 1 + 87
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
276 ÷ 87 = 3 + 15
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
87 ÷ 15 = 5 + 12
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
15 ÷ 12 = 1 + 3
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
12 ÷ 3 = 4 + 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,307) = 3
The two numbers have common prime factors