Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,138; 200,000,000,320) = ?
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,320 = 26 × 5 × 241 × 2,593,361
200,000,000,320 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,320 ÷ 100,000,138 = 1,999 + 99,724,458
Step 2. Divide the smaller number by the above operation's remainder:
100,000,138 ÷ 99,724,458 = 1 + 275,680
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,724,458 ÷ 275,680 = 361 + 203,978
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
275,680 ÷ 203,978 = 1 + 71,702
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
203,978 ÷ 71,702 = 2 + 60,574
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
71,702 ÷ 60,574 = 1 + 11,128
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
60,574 ÷ 11,128 = 5 + 4,934
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
11,128 ÷ 4,934 = 2 + 1,260
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,934 ÷ 1,260 = 3 + 1,154
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,260 ÷ 1,154 = 1 + 106
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,154 ÷ 106 = 10 + 94
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
106 ÷ 94 = 1 + 12
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
94 ÷ 12 = 7 + 10
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
12 ÷ 10 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
10 ÷ 2 = 5 + 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,320) = 2
The two numbers have common prime factors