Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,080; 200,000,000,174) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,080 = 24 × 32 × 5 × 138,889
100,000,080 is not a prime number but a composite one.
200,000,000,174 = 2 × 13 × 439 × 947 × 18,503
200,000,000,174 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,174 ÷ 100,000,080 = 1,999 + 99,840,254
Step 2. Divide the smaller number by the above operation's remainder:
100,000,080 ÷ 99,840,254 = 1 + 159,826
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,840,254 ÷ 159,826 = 624 + 108,830
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
159,826 ÷ 108,830 = 1 + 50,996
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
108,830 ÷ 50,996 = 2 + 6,838
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
50,996 ÷ 6,838 = 7 + 3,130
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
6,838 ÷ 3,130 = 2 + 578
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,130 ÷ 578 = 5 + 240
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
578 ÷ 240 = 2 + 98
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
240 ÷ 98 = 2 + 44
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
98 ÷ 44 = 2 + 10
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
44 ÷ 10 = 4 + 4
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
10 ÷ 4 = 2 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
4 ÷ 2 = 2 + 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,080; 200,000,000,174) = 2
The two numbers have common prime factors