Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,428; 2,024,938) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,428 = 22 × 7 × 19 × 11,279
6,000,428 is not a prime number but a composite one.
2,024,938 = 2 × 17 × 59,557
2,024,938 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,428 ÷ 2,024,938 = 2 + 1,950,552
Step 2. Divide the smaller number by the above operation's remainder:
2,024,938 ÷ 1,950,552 = 1 + 74,386
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,552 ÷ 74,386 = 26 + 16,516
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,386 ÷ 16,516 = 4 + 8,322
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
16,516 ÷ 8,322 = 1 + 8,194
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
8,322 ÷ 8,194 = 1 + 128
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
8,194 ÷ 128 = 64 + 2
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
128 ÷ 2 = 64 + 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,428; 2,024,938) = 2
The two numbers have common prime factors