Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,178; 200,000,000,630) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,178 = 2 × 29 × 229 × 7,529
100,000,178 is not a prime number but a composite one.
200,000,000,630 = 2 × 5 × 113 × 2,539 × 69,709
200,000,000,630 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,630 ÷ 100,000,178 = 1,999 + 99,644,808
Step 2. Divide the smaller number by the above operation's remainder:
100,000,178 ÷ 99,644,808 = 1 + 355,370
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,644,808 ÷ 355,370 = 280 + 141,208
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
355,370 ÷ 141,208 = 2 + 72,954
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
141,208 ÷ 72,954 = 1 + 68,254
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
72,954 ÷ 68,254 = 1 + 4,700
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
68,254 ÷ 4,700 = 14 + 2,454
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4,700 ÷ 2,454 = 1 + 2,246
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,454 ÷ 2,246 = 1 + 208
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,246 ÷ 208 = 10 + 166
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
208 ÷ 166 = 1 + 42
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
166 ÷ 42 = 3 + 40
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
42 ÷ 40 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
40 ÷ 2 = 20 + 0
At this step, the remainder is zero, so we stop:
2 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,178; 200,000,000,630) = 2
The two numbers have common prime factors