Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,921; 200,000,000,244) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,921 = 3 × 7 × 503 × 9,467
99,999,921 is not a prime number but a composite one.
200,000,000,244 = 22 × 3 × 112 × 37 × 607 × 6,133
200,000,000,244 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,244 ÷ 99,999,921 = 2,000 + 158,244
Step 2. Divide the smaller number by the above operation's remainder:
99,999,921 ÷ 158,244 = 631 + 147,957
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
158,244 ÷ 147,957 = 1 + 10,287
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
147,957 ÷ 10,287 = 14 + 3,939
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
10,287 ÷ 3,939 = 2 + 2,409
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
3,939 ÷ 2,409 = 1 + 1,530
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,409 ÷ 1,530 = 1 + 879
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,530 ÷ 879 = 1 + 651
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
879 ÷ 651 = 1 + 228
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
651 ÷ 228 = 2 + 195
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
228 ÷ 195 = 1 + 33
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
195 ÷ 33 = 5 + 30
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
33 ÷ 30 = 1 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
30 ÷ 3 = 10 + 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,921; 200,000,000,244) = 3
The two numbers have common prime factors