Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,089; 200,000,000,816) = ?
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,816 = 24 × 7 × 11 × 3,923 × 41,381
200,000,000,816 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,816 ÷ 100,000,089 = 1,999 + 99,822,905
Step 2. Divide the smaller number by the above operation's remainder:
100,000,089 ÷ 99,822,905 = 1 + 177,184
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,822,905 ÷ 177,184 = 563 + 68,313
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
177,184 ÷ 68,313 = 2 + 40,558
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
68,313 ÷ 40,558 = 1 + 27,755
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
40,558 ÷ 27,755 = 1 + 12,803
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
27,755 ÷ 12,803 = 2 + 2,149
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
12,803 ÷ 2,149 = 5 + 2,058
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,149 ÷ 2,058 = 1 + 91
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,058 ÷ 91 = 22 + 56
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
91 ÷ 56 = 1 + 35
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
56 ÷ 35 = 1 + 21
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
35 ÷ 21 = 1 + 14
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
21 ÷ 14 = 1 + 7
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
14 ÷ 7 = 2 + 0
At this step, the remainder is zero, so we stop:
7 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,816) = 7
The two numbers have common prime factors