Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,454; 2,024,970) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,454 = 2 × 732 × 563
6,000,454 is not a prime number but a composite one.
2,024,970 = 2 × 3 × 5 × 67,499
2,024,970 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,454 ÷ 2,024,970 = 2 + 1,950,514
Step 2. Divide the smaller number by the above operation's remainder:
2,024,970 ÷ 1,950,514 = 1 + 74,456
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,514 ÷ 74,456 = 26 + 14,658
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,456 ÷ 14,658 = 5 + 1,166
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
14,658 ÷ 1,166 = 12 + 666
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
1,166 ÷ 666 = 1 + 500
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
666 ÷ 500 = 1 + 166
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
500 ÷ 166 = 3 + 2
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
166 ÷ 2 = 83 + 0
At this step, the remainder is zero, so we stop:
2 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,454; 2,024,970) = 2
The two numbers have common prime factors