Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,158; 200,000,000,752) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,158 = 2 × 3 × 149 × 111,857
100,000,158 is not a prime number but a composite one.
200,000,000,752 = 24 × 251 × 677 × 73,561
200,000,000,752 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,752 ÷ 100,000,158 = 1,999 + 99,684,910
Step 2. Divide the smaller number by the above operation's remainder:
100,000,158 ÷ 99,684,910 = 1 + 315,248
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,684,910 ÷ 315,248 = 316 + 66,542
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
315,248 ÷ 66,542 = 4 + 49,080
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
66,542 ÷ 49,080 = 1 + 17,462
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
49,080 ÷ 17,462 = 2 + 14,156
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
17,462 ÷ 14,156 = 1 + 3,306
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
14,156 ÷ 3,306 = 4 + 932
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,306 ÷ 932 = 3 + 510
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
932 ÷ 510 = 1 + 422
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
510 ÷ 422 = 1 + 88
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
422 ÷ 88 = 4 + 70
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
88 ÷ 70 = 1 + 18
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
70 ÷ 18 = 3 + 16
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
18 ÷ 16 = 1 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
16 ÷ 2 = 8 + 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,158; 200,000,000,752) = 2
The two numbers have common prime factors