Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,175; 200,000,000,266) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,175 = 52 × 11 × 79 × 4,603
100,000,175 is not a prime number but a composite one.
200,000,000,266 = 2 × 11 × 17 × 534,759,359
200,000,000,266 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,266 ÷ 100,000,175 = 1,999 + 99,650,441
Step 2. Divide the smaller number by the above operation's remainder:
100,000,175 ÷ 99,650,441 = 1 + 349,734
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,650,441 ÷ 349,734 = 284 + 325,985
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
349,734 ÷ 325,985 = 1 + 23,749
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
325,985 ÷ 23,749 = 13 + 17,248
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
23,749 ÷ 17,248 = 1 + 6,501
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
17,248 ÷ 6,501 = 2 + 4,246
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,501 ÷ 4,246 = 1 + 2,255
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,246 ÷ 2,255 = 1 + 1,991
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,255 ÷ 1,991 = 1 + 264
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,991 ÷ 264 = 7 + 143
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
264 ÷ 143 = 1 + 121
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
143 ÷ 121 = 1 + 22
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
121 ÷ 22 = 5 + 11
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
22 ÷ 11 = 2 + 0
At this step, the remainder is zero, so we stop:
11 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,175; 200,000,000,266) = 11
The two numbers have common prime factors