Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,156; 200,000,000,926) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,156 = 22 × 751 × 33,289
100,000,156 is not a prime number but a composite one.
200,000,000,926 = 2 × 11 × 2,957 × 3,074,369
200,000,000,926 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,926 ÷ 100,000,156 = 1,999 + 99,689,082
Step 2. Divide the smaller number by the above operation's remainder:
100,000,156 ÷ 99,689,082 = 1 + 311,074
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,689,082 ÷ 311,074 = 320 + 145,402
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
311,074 ÷ 145,402 = 2 + 20,270
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
145,402 ÷ 20,270 = 7 + 3,512
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
20,270 ÷ 3,512 = 5 + 2,710
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,512 ÷ 2,710 = 1 + 802
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,710 ÷ 802 = 3 + 304
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
802 ÷ 304 = 2 + 194
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
304 ÷ 194 = 1 + 110
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
194 ÷ 110 = 1 + 84
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
110 ÷ 84 = 1 + 26
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
84 ÷ 26 = 3 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
26 ÷ 6 = 4 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 2 = 3 + 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,156; 200,000,000,926) = 2
The two numbers have common prime factors