Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,328; 2,024,964) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,328 = 25 × 32 × 37 × 563
5,999,328 is not a prime number but a composite one.
2,024,964 = 22 × 32 × 56,249
2,024,964 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,328 ÷ 2,024,964 = 2 + 1,949,400
Step 2. Divide the smaller number by the above operation's remainder:
2,024,964 ÷ 1,949,400 = 1 + 75,564
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,400 ÷ 75,564 = 25 + 60,300
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,564 ÷ 60,300 = 1 + 15,264
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
60,300 ÷ 15,264 = 3 + 14,508
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
15,264 ÷ 14,508 = 1 + 756
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
14,508 ÷ 756 = 19 + 144
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
756 ÷ 144 = 5 + 36
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
144 ÷ 36 = 4 + 0
At this step, the remainder is zero, so we stop:
36 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,328; 2,024,964) = 36 = 22 × 32
The two numbers have common prime factors