Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,080; 200,000,000,709) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,080 = 24 × 32 × 5 × 138,889
100,000,080 is not a prime number but a composite one.
200,000,000,709 = 32 × 311 × 787 × 90,793
200,000,000,709 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,709 ÷ 100,000,080 = 1,999 + 99,840,789
Step 2. Divide the smaller number by the above operation's remainder:
100,000,080 ÷ 99,840,789 = 1 + 159,291
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,840,789 ÷ 159,291 = 626 + 124,623
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
159,291 ÷ 124,623 = 1 + 34,668
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
124,623 ÷ 34,668 = 3 + 20,619
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
34,668 ÷ 20,619 = 1 + 14,049
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
20,619 ÷ 14,049 = 1 + 6,570
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
14,049 ÷ 6,570 = 2 + 909
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
6,570 ÷ 909 = 7 + 207
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
909 ÷ 207 = 4 + 81
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
207 ÷ 81 = 2 + 45
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
81 ÷ 45 = 1 + 36
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
45 ÷ 36 = 1 + 9
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
36 ÷ 9 = 4 + 0
At this step, the remainder is zero, so we stop:
9 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,080; 200,000,000,709) = 9 = 32
The two numbers have common prime factors