Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,089; 200,000,000,814) = ?
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,814 = 2 × 3 × 33,333,333,469
200,000,000,814 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,814 ÷ 100,000,089 = 1,999 + 99,822,903
Step 2. Divide the smaller number by the above operation's remainder:
100,000,089 ÷ 99,822,903 = 1 + 177,186
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,822,903 ÷ 177,186 = 563 + 67,185
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
177,186 ÷ 67,185 = 2 + 42,816
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
67,185 ÷ 42,816 = 1 + 24,369
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
42,816 ÷ 24,369 = 1 + 18,447
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
24,369 ÷ 18,447 = 1 + 5,922
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
18,447 ÷ 5,922 = 3 + 681
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
5,922 ÷ 681 = 8 + 474
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
681 ÷ 474 = 1 + 207
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
474 ÷ 207 = 2 + 60
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
207 ÷ 60 = 3 + 27
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
60 ÷ 27 = 2 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
27 ÷ 6 = 4 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 3 = 2 + 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,814) = 3
The two numbers have common prime factors