Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,886; 200,000,000,512) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,886 = 2 × 72 × 1,020,407
99,999,886 is not a prime number but a composite one.
200,000,000,512 = 29 × 13 × 30,048,077
200,000,000,512 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,512 ÷ 99,999,886 = 2,000 + 228,512
Step 2. Divide the smaller number by the above operation's remainder:
99,999,886 ÷ 228,512 = 437 + 140,142
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
228,512 ÷ 140,142 = 1 + 88,370
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
140,142 ÷ 88,370 = 1 + 51,772
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
88,370 ÷ 51,772 = 1 + 36,598
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
51,772 ÷ 36,598 = 1 + 15,174
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
36,598 ÷ 15,174 = 2 + 6,250
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
15,174 ÷ 6,250 = 2 + 2,674
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
6,250 ÷ 2,674 = 2 + 902
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,674 ÷ 902 = 2 + 870
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
902 ÷ 870 = 1 + 32
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
870 ÷ 32 = 27 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
32 ÷ 6 = 5 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
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,886; 200,000,000,512) = 2
The two numbers have common prime factors