Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,430; 2,024,940) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,430 = 2 × 5 × 600,043
6,000,430 is not a prime number but a composite one.
2,024,940 = 22 × 3 × 5 × 33,749
2,024,940 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,430 ÷ 2,024,940 = 2 + 1,950,550
Step 2. Divide the smaller number by the above operation's remainder:
2,024,940 ÷ 1,950,550 = 1 + 74,390
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,550 ÷ 74,390 = 26 + 16,410
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,390 ÷ 16,410 = 4 + 8,750
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
16,410 ÷ 8,750 = 1 + 7,660
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
8,750 ÷ 7,660 = 1 + 1,090
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
7,660 ÷ 1,090 = 7 + 30
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,090 ÷ 30 = 36 + 10
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
30 ÷ 10 = 3 + 0
At this step, the remainder is zero, so we stop:
10 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,430; 2,024,940) = 10 = 2 × 5
The two numbers have common prime factors