Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,514; 2,024,949) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,514 = 2 × 132 × 41 × 433
6,000,514 is not a prime number but a composite one.
2,024,949 = 3 × 41 × 101 × 163
2,024,949 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,514 ÷ 2,024,949 = 2 + 1,950,616
Step 2. Divide the smaller number by the above operation's remainder:
2,024,949 ÷ 1,950,616 = 1 + 74,333
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,616 ÷ 74,333 = 26 + 17,958
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,333 ÷ 17,958 = 4 + 2,501
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
17,958 ÷ 2,501 = 7 + 451
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
2,501 ÷ 451 = 5 + 246
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
451 ÷ 246 = 1 + 205
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
246 ÷ 205 = 1 + 41
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
205 ÷ 41 = 5 + 0
At this step, the remainder is zero, so we stop:
41 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,514; 2,024,949) = 41
The two numbers have common prime factors