Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,134; 200,000,000,206) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,134 = 2 × 32 × 13 × 427,351
100,000,134 is not a prime number but a composite one.
200,000,000,206 = 2 × 100,000,000,103
200,000,000,206 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,206 ÷ 100,000,134 = 1,999 + 99,732,340
Step 2. Divide the smaller number by the above operation's remainder:
100,000,134 ÷ 99,732,340 = 1 + 267,794
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,732,340 ÷ 267,794 = 372 + 112,972
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
267,794 ÷ 112,972 = 2 + 41,850
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
112,972 ÷ 41,850 = 2 + 29,272
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
41,850 ÷ 29,272 = 1 + 12,578
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
29,272 ÷ 12,578 = 2 + 4,116
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
12,578 ÷ 4,116 = 3 + 230
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,116 ÷ 230 = 17 + 206
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
230 ÷ 206 = 1 + 24
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
206 ÷ 24 = 8 + 14
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
24 ÷ 14 = 1 + 10
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
14 ÷ 10 = 1 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
10 ÷ 4 = 2 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
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,134; 200,000,000,206) = 2
The two numbers have common prime factors