Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,086; 200,000,000,344) = ?
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,344 = 23 × 29 × 67 × 2,377 × 5,413
200,000,000,344 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,344 ÷ 100,000,086 = 1,999 + 99,828,430
Step 2. Divide the smaller number by the above operation's remainder:
100,000,086 ÷ 99,828,430 = 1 + 171,656
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,828,430 ÷ 171,656 = 581 + 96,294
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
171,656 ÷ 96,294 = 1 + 75,362
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
96,294 ÷ 75,362 = 1 + 20,932
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
75,362 ÷ 20,932 = 3 + 12,566
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
20,932 ÷ 12,566 = 1 + 8,366
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
12,566 ÷ 8,366 = 1 + 4,200
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
8,366 ÷ 4,200 = 1 + 4,166
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
4,200 ÷ 4,166 = 1 + 34
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
4,166 ÷ 34 = 122 + 18
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
34 ÷ 18 = 1 + 16
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
18 ÷ 16 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
16 ÷ 2 = 8 + 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,086; 200,000,000,344) = 2
The two numbers have common prime factors