Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,586; 200,000,000,208) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,586 = 2 × 1,283 × 38,971
99,999,586 is not a prime number but a composite one.
200,000,000,208 = 24 × 3 × 59 × 61 × 1,157,729
200,000,000,208 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,208 ÷ 99,999,586 = 2,000 + 828,208
Step 2. Divide the smaller number by the above operation's remainder:
99,999,586 ÷ 828,208 = 120 + 614,626
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
828,208 ÷ 614,626 = 1 + 213,582
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
614,626 ÷ 213,582 = 2 + 187,462
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
213,582 ÷ 187,462 = 1 + 26,120
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
187,462 ÷ 26,120 = 7 + 4,622
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
26,120 ÷ 4,622 = 5 + 3,010
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4,622 ÷ 3,010 = 1 + 1,612
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,010 ÷ 1,612 = 1 + 1,398
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,612 ÷ 1,398 = 1 + 214
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,398 ÷ 214 = 6 + 114
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
214 ÷ 114 = 1 + 100
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
114 ÷ 100 = 1 + 14
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
100 ÷ 14 = 7 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
14 ÷ 2 = 7 + 0
At this step, the remainder is zero, so we stop:
2 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 (99,999,586; 200,000,000,208) = 2
The two numbers have common prime factors