Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,112; 200,000,001,186) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,112 = 24 × 43 × 145,349
100,000,112 is not a prime number but a composite one.
200,000,001,186 = 2 × 32 × 811 × 1,901 × 7,207
200,000,001,186 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,186 ÷ 100,000,112 = 1,999 + 99,777,298
Step 2. Divide the smaller number by the above operation's remainder:
100,000,112 ÷ 99,777,298 = 1 + 222,814
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,777,298 ÷ 222,814 = 447 + 179,440
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
222,814 ÷ 179,440 = 1 + 43,374
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
179,440 ÷ 43,374 = 4 + 5,944
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
43,374 ÷ 5,944 = 7 + 1,766
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
5,944 ÷ 1,766 = 3 + 646
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,766 ÷ 646 = 2 + 474
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
646 ÷ 474 = 1 + 172
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
474 ÷ 172 = 2 + 130
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
172 ÷ 130 = 1 + 42
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
130 ÷ 42 = 3 + 4
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
42 ÷ 4 = 10 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
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,112; 200,000,001,186) = 2
The two numbers have common prime factors