Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,150; 200,000,000,866) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,150 = 2 × 52 × 2,000,003
100,000,150 is not a prime number but a composite one.
200,000,000,866 = 2 × 29 × 53 × 65,061,809
200,000,000,866 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,866 ÷ 100,000,150 = 1,999 + 99,701,016
Step 2. Divide the smaller number by the above operation's remainder:
100,000,150 ÷ 99,701,016 = 1 + 299,134
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,701,016 ÷ 299,134 = 333 + 89,394
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
299,134 ÷ 89,394 = 3 + 30,952
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
89,394 ÷ 30,952 = 2 + 27,490
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
30,952 ÷ 27,490 = 1 + 3,462
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
27,490 ÷ 3,462 = 7 + 3,256
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,462 ÷ 3,256 = 1 + 206
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,256 ÷ 206 = 15 + 166
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
206 ÷ 166 = 1 + 40
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
166 ÷ 40 = 4 + 6
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
40 ÷ 6 = 6 + 4
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
6 ÷ 4 = 1 + 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,150; 200,000,000,866) = 2
The two numbers have common prime factors