Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,409; 2,024,901) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,409 = 32 × 13 × 47 × 1,091
5,999,409 is not a prime number but a composite one.
2,024,901 = 32 × 47 × 4,787
2,024,901 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,409 ÷ 2,024,901 = 2 + 1,949,607
Step 2. Divide the smaller number by the above operation's remainder:
2,024,901 ÷ 1,949,607 = 1 + 75,294
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,607 ÷ 75,294 = 25 + 67,257
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,294 ÷ 67,257 = 1 + 8,037
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
67,257 ÷ 8,037 = 8 + 2,961
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
8,037 ÷ 2,961 = 2 + 2,115
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,961 ÷ 2,115 = 1 + 846
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,115 ÷ 846 = 2 + 423
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
846 ÷ 423 = 2 + 0
At this step, the remainder is zero, so we stop:
423 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,409; 2,024,901) = 423 = 32 × 47
The two numbers have common prime factors