Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,162; 200,000,000,250) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,162 = 2 × 59 × 443 × 1,913
100,000,162 is not a prime number but a composite one.
200,000,000,250 = 2 × 32 × 53 × 251 × 354,139
200,000,000,250 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,250 ÷ 100,000,162 = 1,999 + 99,676,412
Step 2. Divide the smaller number by the above operation's remainder:
100,000,162 ÷ 99,676,412 = 1 + 323,750
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,676,412 ÷ 323,750 = 307 + 285,162
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
323,750 ÷ 285,162 = 1 + 38,588
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
285,162 ÷ 38,588 = 7 + 15,046
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
38,588 ÷ 15,046 = 2 + 8,496
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
15,046 ÷ 8,496 = 1 + 6,550
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,496 ÷ 6,550 = 1 + 1,946
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
6,550 ÷ 1,946 = 3 + 712
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,946 ÷ 712 = 2 + 522
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
712 ÷ 522 = 1 + 190
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
522 ÷ 190 = 2 + 142
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
190 ÷ 142 = 1 + 48
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
142 ÷ 48 = 2 + 46
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
48 ÷ 46 = 1 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
46 ÷ 2 = 23 + 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,162; 200,000,000,250) = 2
The two numbers have common prime factors