Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,138; 200,000,000,980) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,138 = 2 × 7 × 691 × 10,337
100,000,138 is not a prime number but a composite one.
200,000,000,980 = 22 × 5 × 13 × 17 × 293 × 389 × 397
200,000,000,980 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,980 ÷ 100,000,138 = 1,999 + 99,725,118
Step 2. Divide the smaller number by the above operation's remainder:
100,000,138 ÷ 99,725,118 = 1 + 275,020
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,725,118 ÷ 275,020 = 362 + 167,878
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
275,020 ÷ 167,878 = 1 + 107,142
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
167,878 ÷ 107,142 = 1 + 60,736
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
107,142 ÷ 60,736 = 1 + 46,406
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
60,736 ÷ 46,406 = 1 + 14,330
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
46,406 ÷ 14,330 = 3 + 3,416
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
14,330 ÷ 3,416 = 4 + 666
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
3,416 ÷ 666 = 5 + 86
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
666 ÷ 86 = 7 + 64
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
86 ÷ 64 = 1 + 22
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
64 ÷ 22 = 2 + 20
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
22 ÷ 20 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
20 ÷ 2 = 10 + 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,138; 200,000,000,980) = 2
The two numbers have common prime factors