Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,198; 200,000,000,160) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,198 = 2 × 43 × 1,162,793
100,000,198 is not a prime number but a composite one.
200,000,000,160 = 25 × 32 × 5 × 107 × 1,298,027
200,000,000,160 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,160 ÷ 100,000,198 = 1,999 + 99,604,358
Step 2. Divide the smaller number by the above operation's remainder:
100,000,198 ÷ 99,604,358 = 1 + 395,840
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,604,358 ÷ 395,840 = 251 + 248,518
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
395,840 ÷ 248,518 = 1 + 147,322
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
248,518 ÷ 147,322 = 1 + 101,196
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
147,322 ÷ 101,196 = 1 + 46,126
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
101,196 ÷ 46,126 = 2 + 8,944
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
46,126 ÷ 8,944 = 5 + 1,406
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
8,944 ÷ 1,406 = 6 + 508
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,406 ÷ 508 = 2 + 390
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
508 ÷ 390 = 1 + 118
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
390 ÷ 118 = 3 + 36
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
118 ÷ 36 = 3 + 10
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
36 ÷ 10 = 3 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
10 ÷ 6 = 1 + 4
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
6 ÷ 4 = 1 + 2
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
4 ÷ 2 = 2 + 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 (100,000,198; 200,000,000,160) = 2
The two numbers have common prime factors