Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,934; 200,000,000,226) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,934 = 2 × 167 × 299,401
99,999,934 is not a prime number but a composite one.
200,000,000,226 = 2 × 3 × 132 × 41 × 1,019 × 4,721
200,000,000,226 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,226 ÷ 99,999,934 = 2,000 + 132,226
Step 2. Divide the smaller number by the above operation's remainder:
99,999,934 ÷ 132,226 = 756 + 37,078
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
132,226 ÷ 37,078 = 3 + 20,992
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
37,078 ÷ 20,992 = 1 + 16,086
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
20,992 ÷ 16,086 = 1 + 4,906
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
16,086 ÷ 4,906 = 3 + 1,368
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,906 ÷ 1,368 = 3 + 802
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,368 ÷ 802 = 1 + 566
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
802 ÷ 566 = 1 + 236
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
566 ÷ 236 = 2 + 94
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
236 ÷ 94 = 2 + 48
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
94 ÷ 48 = 1 + 46
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
48 ÷ 46 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
46 ÷ 2 = 23 + 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,934; 200,000,000,226) = 2
The two numbers have common prime factors