Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,405; 2,024,921) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,405 = 3 × 5 × 17 × 23,531
6,000,405 is not a prime number but a composite one.
2,024,921 = 17 × 311 × 383
2,024,921 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:
6,000,405 ÷ 2,024,921 = 2 + 1,950,563
Step 2. Divide the smaller number by the above operation's remainder:
2,024,921 ÷ 1,950,563 = 1 + 74,358
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,563 ÷ 74,358 = 26 + 17,255
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,358 ÷ 17,255 = 4 + 5,338
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
17,255 ÷ 5,338 = 3 + 1,241
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
5,338 ÷ 1,241 = 4 + 374
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,241 ÷ 374 = 3 + 119
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
374 ÷ 119 = 3 + 17
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
119 ÷ 17 = 7 + 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 (6,000,405; 2,024,921) = 17
The two numbers have common prime factors