Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,014; 200,000,000,586) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,014 = 2 × 3 × 16,666,669
100,000,014 is not a prime number but a composite one.
200,000,000,586 = 2 × 3 × 6,427 × 5,186,453
200,000,000,586 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,586 ÷ 100,000,014 = 1,999 + 99,972,600
Step 2. Divide the smaller number by the above operation's remainder:
100,000,014 ÷ 99,972,600 = 1 + 27,414
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,972,600 ÷ 27,414 = 3,646 + 21,156
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
27,414 ÷ 21,156 = 1 + 6,258
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
21,156 ÷ 6,258 = 3 + 2,382
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
6,258 ÷ 2,382 = 2 + 1,494
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,382 ÷ 1,494 = 1 + 888
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,494 ÷ 888 = 1 + 606
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
888 ÷ 606 = 1 + 282
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
606 ÷ 282 = 2 + 42
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
282 ÷ 42 = 6 + 30
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
42 ÷ 30 = 1 + 12
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
30 ÷ 12 = 2 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
12 ÷ 6 = 2 + 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,014; 200,000,000,586) = 6 = 2 × 3
The two numbers have common prime factors