Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,089; 200,000,000,640) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,089 = 35 × 7 × 58,789
100,000,089 is not a prime number but a composite one.
200,000,000,640 = 27 × 3 × 5 × 11 × 17 × 557,041
200,000,000,640 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,640 ÷ 100,000,089 = 1,999 + 99,822,729
Step 2. Divide the smaller number by the above operation's remainder:
100,000,089 ÷ 99,822,729 = 1 + 177,360
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,822,729 ÷ 177,360 = 562 + 146,409
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
177,360 ÷ 146,409 = 1 + 30,951
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
146,409 ÷ 30,951 = 4 + 22,605
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
30,951 ÷ 22,605 = 1 + 8,346
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
22,605 ÷ 8,346 = 2 + 5,913
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,346 ÷ 5,913 = 1 + 2,433
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
5,913 ÷ 2,433 = 2 + 1,047
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,433 ÷ 1,047 = 2 + 339
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,047 ÷ 339 = 3 + 30
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
339 ÷ 30 = 11 + 9
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
30 ÷ 9 = 3 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
9 ÷ 3 = 3 + 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,089; 200,000,000,640) = 3
The two numbers have common prime factors