Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,120; 200,000,000,846) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,120 = 23 × 5 × 11 × 17 × 29 × 461
100,000,120 is not a prime number but a composite one.
200,000,000,846 = 2 × 19 × 23,143 × 227,419
200,000,000,846 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,846 ÷ 100,000,120 = 1,999 + 99,760,966
Step 2. Divide the smaller number by the above operation's remainder:
100,000,120 ÷ 99,760,966 = 1 + 239,154
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,760,966 ÷ 239,154 = 417 + 33,748
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
239,154 ÷ 33,748 = 7 + 2,918
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
33,748 ÷ 2,918 = 11 + 1,650
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
2,918 ÷ 1,650 = 1 + 1,268
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,650 ÷ 1,268 = 1 + 382
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,268 ÷ 382 = 3 + 122
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
382 ÷ 122 = 3 + 16
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
122 ÷ 16 = 7 + 10
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
16 ÷ 10 = 1 + 6
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
10 ÷ 6 = 1 + 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,120; 200,000,000,846) = 2
The two numbers have common prime factors