Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,574; 2,024,958) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,574 = 2 × 3 × 7 × 211 × 677
5,999,574 is not a prime number but a composite one.
2,024,958 = 2 × 3 × 132 × 1,997
2,024,958 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,574 ÷ 2,024,958 = 2 + 1,949,658
Step 2. Divide the smaller number by the above operation's remainder:
2,024,958 ÷ 1,949,658 = 1 + 75,300
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,658 ÷ 75,300 = 25 + 67,158
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,300 ÷ 67,158 = 1 + 8,142
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
67,158 ÷ 8,142 = 8 + 2,022
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
8,142 ÷ 2,022 = 4 + 54
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,022 ÷ 54 = 37 + 24
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
54 ÷ 24 = 2 + 6
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
24 ÷ 6 = 4 + 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 (5,999,574; 2,024,958) = 6 = 2 × 3
The two numbers have common prime factors