Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,134; 200,000,000,340) = ?
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,340 = 22 × 33 × 5 × 73 × 1,079,797
200,000,000,340 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,340 ÷ 100,000,134 = 1,999 + 99,732,474
Step 2. Divide the smaller number by the above operation's remainder:
100,000,134 ÷ 99,732,474 = 1 + 267,660
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,732,474 ÷ 267,660 = 372 + 162,954
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
267,660 ÷ 162,954 = 1 + 104,706
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
162,954 ÷ 104,706 = 1 + 58,248
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
104,706 ÷ 58,248 = 1 + 46,458
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
58,248 ÷ 46,458 = 1 + 11,790
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
46,458 ÷ 11,790 = 3 + 11,088
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
11,790 ÷ 11,088 = 1 + 702
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
11,088 ÷ 702 = 15 + 558
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
702 ÷ 558 = 1 + 144
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
558 ÷ 144 = 3 + 126
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
144 ÷ 126 = 1 + 18
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
126 ÷ 18 = 7 + 0
At this step, the remainder is zero, so we stop:
18 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,340) = 18 = 2 × 32
The two numbers have common prime factors