Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,110; 200,000,000,901) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,110 = 2 × 3 × 5 × 7 × 31 × 15,361
100,000,110 is not a prime number but a composite one.
200,000,000,901 = 3 × 66,666,666,967
200,000,000,901 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,901 ÷ 100,000,110 = 1,999 + 99,781,011
Step 2. Divide the smaller number by the above operation's remainder:
100,000,110 ÷ 99,781,011 = 1 + 219,099
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,781,011 ÷ 219,099 = 455 + 90,966
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
219,099 ÷ 90,966 = 2 + 37,167
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
90,966 ÷ 37,167 = 2 + 16,632
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
37,167 ÷ 16,632 = 2 + 3,903
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
16,632 ÷ 3,903 = 4 + 1,020
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,903 ÷ 1,020 = 3 + 843
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,020 ÷ 843 = 1 + 177
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
843 ÷ 177 = 4 + 135
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
177 ÷ 135 = 1 + 42
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
135 ÷ 42 = 3 + 9
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
42 ÷ 9 = 4 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
9 ÷ 6 = 1 + 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,110; 200,000,000,901) = 3
The two numbers have common prime factors