Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,094; 200,000,000,262) = ?
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,262 = 2 × 3 × 33,333,333,377
200,000,000,262 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,262 ÷ 100,000,094 = 1,999 + 99,812,356
Step 2. Divide the smaller number by the above operation's remainder:
100,000,094 ÷ 99,812,356 = 1 + 187,738
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,812,356 ÷ 187,738 = 531 + 123,478
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
187,738 ÷ 123,478 = 1 + 64,260
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
123,478 ÷ 64,260 = 1 + 59,218
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
64,260 ÷ 59,218 = 1 + 5,042
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
59,218 ÷ 5,042 = 11 + 3,756
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,042 ÷ 3,756 = 1 + 1,286
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,756 ÷ 1,286 = 2 + 1,184
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,286 ÷ 1,184 = 1 + 102
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,184 ÷ 102 = 11 + 62
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
102 ÷ 62 = 1 + 40
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
62 ÷ 40 = 1 + 22
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
40 ÷ 22 = 1 + 18
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
22 ÷ 18 = 1 + 4
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
18 ÷ 4 = 4 + 2
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
4 ÷ 2 = 2 + 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,262) = 2
The two numbers have common prime factors