Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,446; 2,024,976) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,446 = 2 × 3,000,223
6,000,446 is not a prime number but a composite one.
2,024,976 = 24 × 3 × 42,187
2,024,976 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,446 ÷ 2,024,976 = 2 + 1,950,494
Step 2. Divide the smaller number by the above operation's remainder:
2,024,976 ÷ 1,950,494 = 1 + 74,482
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,494 ÷ 74,482 = 26 + 13,962
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,482 ÷ 13,962 = 5 + 4,672
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
13,962 ÷ 4,672 = 2 + 4,618
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
4,672 ÷ 4,618 = 1 + 54
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,618 ÷ 54 = 85 + 28
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
54 ÷ 28 = 1 + 26
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
28 ÷ 26 = 1 + 2
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
26 ÷ 2 = 13 + 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,446; 2,024,976) = 2
The two numbers have common prime factors