Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,128; 200,000,000,726) = ?
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,726 = 2 × 100,000,000,363
200,000,000,726 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,726 ÷ 100,000,128 = 1,999 + 99,744,854
Step 2. Divide the smaller number by the above operation's remainder:
100,000,128 ÷ 99,744,854 = 1 + 255,274
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,744,854 ÷ 255,274 = 390 + 187,994
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
255,274 ÷ 187,994 = 1 + 67,280
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
187,994 ÷ 67,280 = 2 + 53,434
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
67,280 ÷ 53,434 = 1 + 13,846
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
53,434 ÷ 13,846 = 3 + 11,896
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
13,846 ÷ 11,896 = 1 + 1,950
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
11,896 ÷ 1,950 = 6 + 196
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,950 ÷ 196 = 9 + 186
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
196 ÷ 186 = 1 + 10
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
186 ÷ 10 = 18 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
10 ÷ 6 = 1 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 4 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
4 ÷ 2 = 2 + 0
At this step, the remainder is zero, so we stop:
2 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,726) = 2
The two numbers have common prime factors