Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,149; 200,000,001,039) = ?
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,001,039 = 3 × 66,666,667,013
200,000,001,039 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,001,039 ÷ 100,000,149 = 1,999 + 99,703,188
Step 2. Divide the smaller number by the above operation's remainder:
100,000,149 ÷ 99,703,188 = 1 + 296,961
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,703,188 ÷ 296,961 = 335 + 221,253
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
296,961 ÷ 221,253 = 1 + 75,708
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
221,253 ÷ 75,708 = 2 + 69,837
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
75,708 ÷ 69,837 = 1 + 5,871
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
69,837 ÷ 5,871 = 11 + 5,256
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,871 ÷ 5,256 = 1 + 615
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
5,256 ÷ 615 = 8 + 336
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
615 ÷ 336 = 1 + 279
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
336 ÷ 279 = 1 + 57
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
279 ÷ 57 = 4 + 51
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
57 ÷ 51 = 1 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
51 ÷ 6 = 8 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 3 = 2 + 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,001,039) = 3
The two numbers have common prime factors