Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,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.
5,999,430 = 2 × 3 × 5 × 31 × 6,451
5,999,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:
5,999,430 ÷ 2,024,940 = 2 + 1,949,550
Step 2. Divide the smaller number by the above operation's remainder:
2,024,940 ÷ 1,949,550 = 1 + 75,390
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,550 ÷ 75,390 = 25 + 64,800
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,390 ÷ 64,800 = 1 + 10,590
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
64,800 ÷ 10,590 = 6 + 1,260
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
10,590 ÷ 1,260 = 8 + 510
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,260 ÷ 510 = 2 + 240
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
510 ÷ 240 = 2 + 30
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
240 ÷ 30 = 8 + 0
At this step, the remainder is zero, so we stop:
30 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 (5,999,430; 2,024,940) = 30 = 2 × 3 × 5
The two numbers have common prime factors