Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,952; 200,000,000,686) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,952 = 24 × 13 × 23 × 20,903
99,999,952 is not a prime number but a composite one.
200,000,000,686 = 2 × 126,067 × 793,229
200,000,000,686 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,686 ÷ 99,999,952 = 2,000 + 96,686
Step 2. Divide the smaller number by the above operation's remainder:
99,999,952 ÷ 96,686 = 1,034 + 26,628
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
96,686 ÷ 26,628 = 3 + 16,802
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
26,628 ÷ 16,802 = 1 + 9,826
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
16,802 ÷ 9,826 = 1 + 6,976
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
9,826 ÷ 6,976 = 1 + 2,850
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
6,976 ÷ 2,850 = 2 + 1,276
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,850 ÷ 1,276 = 2 + 298
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,276 ÷ 298 = 4 + 84
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
298 ÷ 84 = 3 + 46
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
84 ÷ 46 = 1 + 38
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
46 ÷ 38 = 1 + 8
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
38 ÷ 8 = 4 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
8 ÷ 6 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 2 = 3 + 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,952; 200,000,000,686) = 2
The two numbers have common prime factors