Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,670; 2,024,949) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,670 = 2 × 36 × 5 × 823
5,999,670 is not a prime number but a composite one.
2,024,949 = 3 × 41 × 101 × 163
2,024,949 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:
5,999,670 ÷ 2,024,949 = 2 + 1,949,772
Step 2. Divide the smaller number by the above operation's remainder:
2,024,949 ÷ 1,949,772 = 1 + 75,177
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,772 ÷ 75,177 = 25 + 70,347
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,177 ÷ 70,347 = 1 + 4,830
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
70,347 ÷ 4,830 = 14 + 2,727
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
4,830 ÷ 2,727 = 1 + 2,103
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,727 ÷ 2,103 = 1 + 624
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,103 ÷ 624 = 3 + 231
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
624 ÷ 231 = 2 + 162
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
231 ÷ 162 = 1 + 69
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
162 ÷ 69 = 2 + 24
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
69 ÷ 24 = 2 + 21
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
24 ÷ 21 = 1 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
21 ÷ 3 = 7 + 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 (5,999,670; 2,024,949) = 3
The two numbers have common prime factors