Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,149; 200,000,000,871) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,149 = 3 × 29 × 1,149,427
100,000,149 is not a prime number but a composite one.
200,000,000,871 = 32 × 11 × 7,817 × 258,437
200,000,000,871 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,871 ÷ 100,000,149 = 1,999 + 99,703,020
Step 2. Divide the smaller number by the above operation's remainder:
100,000,149 ÷ 99,703,020 = 1 + 297,129
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,703,020 ÷ 297,129 = 335 + 164,805
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
297,129 ÷ 164,805 = 1 + 132,324
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
164,805 ÷ 132,324 = 1 + 32,481
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
132,324 ÷ 32,481 = 4 + 2,400
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
32,481 ÷ 2,400 = 13 + 1,281
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,400 ÷ 1,281 = 1 + 1,119
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,281 ÷ 1,119 = 1 + 162
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,119 ÷ 162 = 6 + 147
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
162 ÷ 147 = 1 + 15
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
147 ÷ 15 = 9 + 12
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
15 ÷ 12 = 1 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
12 ÷ 3 = 4 + 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 (100,000,149; 200,000,000,871) = 3
The two numbers have common prime factors