Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,242; 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,242 = 2 × 32 × 257 × 21,617
100,000,242 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,242 = 1,999 + 99,516,416
Step 2. Divide the smaller number by the above operation's remainder:
100,000,242 ÷ 99,516,416 = 1 + 483,826
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,516,416 ÷ 483,826 = 205 + 332,086
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
483,826 ÷ 332,086 = 1 + 151,740
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
332,086 ÷ 151,740 = 2 + 28,606
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
151,740 ÷ 28,606 = 5 + 8,710
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
28,606 ÷ 8,710 = 3 + 2,476
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,710 ÷ 2,476 = 3 + 1,282
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,476 ÷ 1,282 = 1 + 1,194
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,282 ÷ 1,194 = 1 + 88
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,194 ÷ 88 = 13 + 50
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
88 ÷ 50 = 1 + 38
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
50 ÷ 38 = 1 + 12
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
38 ÷ 12 = 3 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
12 ÷ 2 = 6 + 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,242; 200,000,000,174) = 2
The two numbers have common prime factors