Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,116; 200,000,000,289) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,116 = 22 × 33 × 19 × 48,733
100,000,116 is not a prime number but a composite one.
200,000,000,289 = 3 × 1,103 × 5,147 × 11,743
200,000,000,289 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,289 ÷ 100,000,116 = 1,999 + 99,768,405
Step 2. Divide the smaller number by the above operation's remainder:
100,000,116 ÷ 99,768,405 = 1 + 231,711
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,768,405 ÷ 231,711 = 430 + 132,675
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
231,711 ÷ 132,675 = 1 + 99,036
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
132,675 ÷ 99,036 = 1 + 33,639
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
99,036 ÷ 33,639 = 2 + 31,758
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
33,639 ÷ 31,758 = 1 + 1,881
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
31,758 ÷ 1,881 = 16 + 1,662
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,881 ÷ 1,662 = 1 + 219
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,662 ÷ 219 = 7 + 129
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
219 ÷ 129 = 1 + 90
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
129 ÷ 90 = 1 + 39
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
90 ÷ 39 = 2 + 12
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
39 ÷ 12 = 3 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
12 ÷ 3 = 4 + 0
At this step, the remainder is zero, so we stop:
3 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,116; 200,000,000,289) = 3
The two numbers have common prime factors