Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,604; 200,000,000,208) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,604 = 22 × 37 × 181 × 3,733
99,999,604 is not a prime number but a composite one.
200,000,000,208 = 24 × 3 × 59 × 61 × 1,157,729
200,000,000,208 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,208 ÷ 99,999,604 = 2,000 + 792,208
Step 2. Divide the smaller number by the above operation's remainder:
99,999,604 ÷ 792,208 = 126 + 181,396
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
792,208 ÷ 181,396 = 4 + 66,624
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
181,396 ÷ 66,624 = 2 + 48,148
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
66,624 ÷ 48,148 = 1 + 18,476
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
48,148 ÷ 18,476 = 2 + 11,196
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
18,476 ÷ 11,196 = 1 + 7,280
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
11,196 ÷ 7,280 = 1 + 3,916
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
7,280 ÷ 3,916 = 1 + 3,364
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
3,916 ÷ 3,364 = 1 + 552
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
3,364 ÷ 552 = 6 + 52
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
552 ÷ 52 = 10 + 32
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
52 ÷ 32 = 1 + 20
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
32 ÷ 20 = 1 + 12
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
20 ÷ 12 = 1 + 8
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
12 ÷ 8 = 1 + 4
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
8 ÷ 4 = 2 + 0
At this step, the remainder is zero, so we stop:
4 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,604; 200,000,000,208) = 4 = 22
The two numbers have common prime factors