Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,128; 200,000,000,772) = ?
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,772 = 22 × 34 × 11 × 13 × 631 × 6,841
200,000,000,772 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,772 ÷ 100,000,128 = 1,999 + 99,744,900
Step 2. Divide the smaller number by the above operation's remainder:
100,000,128 ÷ 99,744,900 = 1 + 255,228
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,744,900 ÷ 255,228 = 390 + 205,980
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
255,228 ÷ 205,980 = 1 + 49,248
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
205,980 ÷ 49,248 = 4 + 8,988
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
49,248 ÷ 8,988 = 5 + 4,308
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
8,988 ÷ 4,308 = 2 + 372
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4,308 ÷ 372 = 11 + 216
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
372 ÷ 216 = 1 + 156
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
216 ÷ 156 = 1 + 60
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
156 ÷ 60 = 2 + 36
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
60 ÷ 36 = 1 + 24
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
36 ÷ 24 = 1 + 12
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
24 ÷ 12 = 2 + 0
At this step, the remainder is zero, so we stop:
12 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,772) = 12 = 22 × 3
The two numbers have common prime factors