Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,185; 200,000,000,349) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,185 = 3 × 5 × 6,666,679
100,000,185 is not a prime number but a composite one.
200,000,000,349 = 32 × 41 × 22,679 × 23,899
200,000,000,349 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,349 ÷ 100,000,185 = 1,999 + 99,630,534
Step 2. Divide the smaller number by the above operation's remainder:
100,000,185 ÷ 99,630,534 = 1 + 369,651
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,630,534 ÷ 369,651 = 269 + 194,415
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
369,651 ÷ 194,415 = 1 + 175,236
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
194,415 ÷ 175,236 = 1 + 19,179
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
175,236 ÷ 19,179 = 9 + 2,625
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
19,179 ÷ 2,625 = 7 + 804
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,625 ÷ 804 = 3 + 213
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
804 ÷ 213 = 3 + 165
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
213 ÷ 165 = 1 + 48
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
165 ÷ 48 = 3 + 21
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
48 ÷ 21 = 2 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
21 ÷ 6 = 3 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
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,185; 200,000,000,349) = 3
The two numbers have common prime factors