Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,403; 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,403 = 3 × 43 × 46,507
5,999,403 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,403 ÷ 2,024,955 = 2 + 1,949,493
Step 2. Divide the smaller number by the above operation's remainder:
2,024,955 ÷ 1,949,493 = 1 + 75,462
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,493 ÷ 75,462 = 25 + 62,943
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,462 ÷ 62,943 = 1 + 12,519
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
62,943 ÷ 12,519 = 5 + 348
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
12,519 ÷ 348 = 35 + 339
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
348 ÷ 339 = 1 + 9
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
339 ÷ 9 = 37 + 6
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
9 ÷ 6 = 1 + 3
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
6 ÷ 3 = 2 + 0
At this step, the remainder is zero, so we stop:
3 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,403; 2,024,955) = 3
The two numbers have common prime factors