Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,119; 200,000,000,154) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,119 = 3 × 33,333,373
100,000,119 is not a prime number but a composite one.
200,000,000,154 = 2 × 3 × 3,187 × 10,459,157
200,000,000,154 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,154 ÷ 100,000,119 = 1,999 + 99,762,273
Step 2. Divide the smaller number by the above operation's remainder:
100,000,119 ÷ 99,762,273 = 1 + 237,846
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,762,273 ÷ 237,846 = 419 + 104,799
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
237,846 ÷ 104,799 = 2 + 28,248
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
104,799 ÷ 28,248 = 3 + 20,055
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
28,248 ÷ 20,055 = 1 + 8,193
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
20,055 ÷ 8,193 = 2 + 3,669
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,193 ÷ 3,669 = 2 + 855
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,669 ÷ 855 = 4 + 249
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
855 ÷ 249 = 3 + 108
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
249 ÷ 108 = 2 + 33
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
108 ÷ 33 = 3 + 9
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
33 ÷ 9 = 3 + 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,119; 200,000,000,154) = 3
The two numbers have common prime factors