Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,711; 200,000,000,220) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,711 = 33 × 7 × 53 × 67 × 149
99,999,711 is not a prime number but a composite one.
200,000,000,220 = 22 × 3 × 5 × 191 × 17,452,007
200,000,000,220 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,220 ÷ 99,999,711 = 2,000 + 578,220
Step 2. Divide the smaller number by the above operation's remainder:
99,999,711 ÷ 578,220 = 172 + 545,871
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
578,220 ÷ 545,871 = 1 + 32,349
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
545,871 ÷ 32,349 = 16 + 28,287
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
32,349 ÷ 28,287 = 1 + 4,062
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
28,287 ÷ 4,062 = 6 + 3,915
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,062 ÷ 3,915 = 1 + 147
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,915 ÷ 147 = 26 + 93
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
147 ÷ 93 = 1 + 54
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
93 ÷ 54 = 1 + 39
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
54 ÷ 39 = 1 + 15
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
39 ÷ 15 = 2 + 9
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
15 ÷ 9 = 1 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
9 ÷ 6 = 1 + 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 (99,999,711; 200,000,000,220) = 3
The two numbers have common prime factors