Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,094; 200,000,000,160) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,094 = 2 × 50,000,047
100,000,094 is not a prime number but a composite one.
200,000,000,160 = 25 × 32 × 5 × 107 × 1,298,027
200,000,000,160 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,160 ÷ 100,000,094 = 1,999 + 99,812,254
Step 2. Divide the smaller number by the above operation's remainder:
100,000,094 ÷ 99,812,254 = 1 + 187,840
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,812,254 ÷ 187,840 = 531 + 69,214
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
187,840 ÷ 69,214 = 2 + 49,412
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
69,214 ÷ 49,412 = 1 + 19,802
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
49,412 ÷ 19,802 = 2 + 9,808
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
19,802 ÷ 9,808 = 2 + 186
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
9,808 ÷ 186 = 52 + 136
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
186 ÷ 136 = 1 + 50
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
136 ÷ 50 = 2 + 36
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
50 ÷ 36 = 1 + 14
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
36 ÷ 14 = 2 + 8
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
14 ÷ 8 = 1 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
8 ÷ 6 = 1 + 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,094; 200,000,000,160) = 2
The two numbers have common prime factors