Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,759; 2,024,955) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,759 = 17 × 53 × 6,659
5,999,759 is not a prime number but a composite one.
2,024,955 = 32 × 5 × 17 × 2,647
2,024,955 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,759 ÷ 2,024,955 = 2 + 1,949,849
Step 2. Divide the smaller number by the above operation's remainder:
2,024,955 ÷ 1,949,849 = 1 + 75,106
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,849 ÷ 75,106 = 25 + 72,199
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,106 ÷ 72,199 = 1 + 2,907
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
72,199 ÷ 2,907 = 24 + 2,431
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
2,907 ÷ 2,431 = 1 + 476
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,431 ÷ 476 = 5 + 51
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
476 ÷ 51 = 9 + 17
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
51 ÷ 17 = 3 + 0
At this step, the remainder is zero, so we stop:
17 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,759; 2,024,955) = 17
The two numbers have common prime factors