Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,092; 200,000,001,088) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,092 = 22 × 3 × 71 × 117,371
100,000,092 is not a prime number but a composite one.
200,000,001,088 = 26 × 43 × 72,674,419
200,000,001,088 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,001,088 ÷ 100,000,092 = 1,999 + 99,817,180
Step 2. Divide the smaller number by the above operation's remainder:
100,000,092 ÷ 99,817,180 = 1 + 182,912
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,817,180 ÷ 182,912 = 545 + 130,140
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
182,912 ÷ 130,140 = 1 + 52,772
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
130,140 ÷ 52,772 = 2 + 24,596
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
52,772 ÷ 24,596 = 2 + 3,580
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
24,596 ÷ 3,580 = 6 + 3,116
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,580 ÷ 3,116 = 1 + 464
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,116 ÷ 464 = 6 + 332
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
464 ÷ 332 = 1 + 132
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
332 ÷ 132 = 2 + 68
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
132 ÷ 68 = 1 + 64
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
68 ÷ 64 = 1 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
64 ÷ 4 = 16 + 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,092; 200,000,001,088) = 4 = 22
The two numbers have common prime factors