Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,939; 2,024,924) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,939 = 11 × 545,449
5,999,939 is not a prime number but a composite one.
2,024,924 = 22 × 11 × 46,021
2,024,924 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,939 ÷ 2,024,924 = 2 + 1,950,091
Step 2. Divide the smaller number by the above operation's remainder:
2,024,924 ÷ 1,950,091 = 1 + 74,833
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,091 ÷ 74,833 = 26 + 4,433
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,833 ÷ 4,433 = 16 + 3,905
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
4,433 ÷ 3,905 = 1 + 528
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
3,905 ÷ 528 = 7 + 209
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
528 ÷ 209 = 2 + 110
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
209 ÷ 110 = 1 + 99
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
110 ÷ 99 = 1 + 11
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
99 ÷ 11 = 9 + 0
At this step, the remainder is zero, so we stop:
11 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,939; 2,024,924) = 11
The two numbers have common prime factors