Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,104; 200,000,000,751) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,104 = 23 × 3 × 4,166,671
100,000,104 is not a prime number but a composite one.
200,000,000,751 = 3 × 19 × 3,508,771,943
200,000,000,751 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,751 ÷ 100,000,104 = 1,999 + 99,792,855
Step 2. Divide the smaller number by the above operation's remainder:
100,000,104 ÷ 99,792,855 = 1 + 207,249
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,792,855 ÷ 207,249 = 481 + 106,086
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
207,249 ÷ 106,086 = 1 + 101,163
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
106,086 ÷ 101,163 = 1 + 4,923
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
101,163 ÷ 4,923 = 20 + 2,703
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,923 ÷ 2,703 = 1 + 2,220
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,703 ÷ 2,220 = 1 + 483
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,220 ÷ 483 = 4 + 288
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
483 ÷ 288 = 1 + 195
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
288 ÷ 195 = 1 + 93
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
195 ÷ 93 = 2 + 9
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
93 ÷ 9 = 10 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
9 ÷ 3 = 3 + 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,104; 200,000,000,751) = 3
The two numbers have common prime factors