Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,114; 200,000,000,636) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,114 = 2 × 47 × 1,063,831
100,000,114 is not a prime number but a composite one.
200,000,000,636 = 22 × 41 × 1,219,512,199
200,000,000,636 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,636 ÷ 100,000,114 = 1,999 + 99,772,750
Step 2. Divide the smaller number by the above operation's remainder:
100,000,114 ÷ 99,772,750 = 1 + 227,364
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,772,750 ÷ 227,364 = 438 + 187,318
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
227,364 ÷ 187,318 = 1 + 40,046
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
187,318 ÷ 40,046 = 4 + 27,134
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
40,046 ÷ 27,134 = 1 + 12,912
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
27,134 ÷ 12,912 = 2 + 1,310
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
12,912 ÷ 1,310 = 9 + 1,122
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,310 ÷ 1,122 = 1 + 188
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,122 ÷ 188 = 5 + 182
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
188 ÷ 182 = 1 + 6
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
182 ÷ 6 = 30 + 2
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
6 ÷ 2 = 3 + 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,114; 200,000,000,636) = 2
The two numbers have common prime factors