Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,128; 200,000,000,660) = ?
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,660 = 22 × 5 × 10,000,000,033
200,000,000,660 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,660 ÷ 100,000,128 = 1,999 + 99,744,788
Step 2. Divide the smaller number by the above operation's remainder:
100,000,128 ÷ 99,744,788 = 1 + 255,340
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,744,788 ÷ 255,340 = 390 + 162,188
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
255,340 ÷ 162,188 = 1 + 93,152
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
162,188 ÷ 93,152 = 1 + 69,036
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
93,152 ÷ 69,036 = 1 + 24,116
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
69,036 ÷ 24,116 = 2 + 20,804
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
24,116 ÷ 20,804 = 1 + 3,312
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
20,804 ÷ 3,312 = 6 + 932
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
3,312 ÷ 932 = 3 + 516
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
932 ÷ 516 = 1 + 416
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
516 ÷ 416 = 1 + 100
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
416 ÷ 100 = 4 + 16
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
100 ÷ 16 = 6 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
16 ÷ 4 = 4 + 0
At this step, the remainder is zero, so we stop:
4 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,660) = 4 = 22
The two numbers have common prime factors