Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,875; 2,024,980) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,875 = 53 × 7 × 6,857
5,999,875 is not a prime number but a composite one.
2,024,980 = 22 × 5 × 103 × 983
2,024,980 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,875 ÷ 2,024,980 = 2 + 1,949,915
Step 2. Divide the smaller number by the above operation's remainder:
2,024,980 ÷ 1,949,915 = 1 + 75,065
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,915 ÷ 75,065 = 25 + 73,290
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,065 ÷ 73,290 = 1 + 1,775
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
73,290 ÷ 1,775 = 41 + 515
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
1,775 ÷ 515 = 3 + 230
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
515 ÷ 230 = 2 + 55
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
230 ÷ 55 = 4 + 10
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
55 ÷ 10 = 5 + 5
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
10 ÷ 5 = 2 + 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,875; 2,024,980) = 5
The two numbers have common prime factors