Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,086; 200,000,000,676) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,086 = 2 × 3 × 17 × 980,393
100,000,086 is not a prime number but a composite one.
200,000,000,676 = 22 × 3 × 7 × 2,380,952,389
200,000,000,676 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,676 ÷ 100,000,086 = 1,999 + 99,828,762
Step 2. Divide the smaller number by the above operation's remainder:
100,000,086 ÷ 99,828,762 = 1 + 171,324
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,828,762 ÷ 171,324 = 582 + 118,194
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
171,324 ÷ 118,194 = 1 + 53,130
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
118,194 ÷ 53,130 = 2 + 11,934
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
53,130 ÷ 11,934 = 4 + 5,394
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
11,934 ÷ 5,394 = 2 + 1,146
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,394 ÷ 1,146 = 4 + 810
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,146 ÷ 810 = 1 + 336
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
810 ÷ 336 = 2 + 138
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
336 ÷ 138 = 2 + 60
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
138 ÷ 60 = 2 + 18
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
60 ÷ 18 = 3 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
18 ÷ 6 = 3 + 0
At this step, the remainder is zero, so we stop:
6 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,086; 200,000,000,676) = 6 = 2 × 3
The two numbers have common prime factors