Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,575; 2,024,940) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,575 = 52 × 43 × 5,581
5,999,575 is not a prime number but a composite one.
2,024,940 = 22 × 3 × 5 × 33,749
2,024,940 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,575 ÷ 2,024,940 = 2 + 1,949,695
Step 2. Divide the smaller number by the above operation's remainder:
2,024,940 ÷ 1,949,695 = 1 + 75,245
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,695 ÷ 75,245 = 25 + 68,570
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,245 ÷ 68,570 = 1 + 6,675
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
68,570 ÷ 6,675 = 10 + 1,820
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
6,675 ÷ 1,820 = 3 + 1,215
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,820 ÷ 1,215 = 1 + 605
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,215 ÷ 605 = 2 + 5
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
605 ÷ 5 = 121 + 0
At this step, the remainder is zero, so we stop:
5 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,575; 2,024,940) = 5
The two numbers have common prime factors