Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,094; 200,000,000,186) = ?
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,186 = 2 × 7 × 232 × 397 × 68,023
200,000,000,186 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,186 ÷ 100,000,094 = 1,999 + 99,812,280
Step 2. Divide the smaller number by the above operation's remainder:
100,000,094 ÷ 99,812,280 = 1 + 187,814
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,812,280 ÷ 187,814 = 531 + 83,046
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
187,814 ÷ 83,046 = 2 + 21,722
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
83,046 ÷ 21,722 = 3 + 17,880
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
21,722 ÷ 17,880 = 1 + 3,842
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
17,880 ÷ 3,842 = 4 + 2,512
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,842 ÷ 2,512 = 1 + 1,330
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,512 ÷ 1,330 = 1 + 1,182
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,330 ÷ 1,182 = 1 + 148
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,182 ÷ 148 = 7 + 146
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
148 ÷ 146 = 1 + 2
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
146 ÷ 2 = 73 + 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,186) = 2
The two numbers have common prime factors