Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,824; 2,024,912) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,824 = 24 × 374,989
5,999,824 is not a prime number but a composite one.
2,024,912 = 24 × 271 × 467
2,024,912 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,824 ÷ 2,024,912 = 2 + 1,950,000
Step 2. Divide the smaller number by the above operation's remainder:
2,024,912 ÷ 1,950,000 = 1 + 74,912
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,000 ÷ 74,912 = 26 + 2,288
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,912 ÷ 2,288 = 32 + 1,696
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
2,288 ÷ 1,696 = 1 + 592
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
1,696 ÷ 592 = 2 + 512
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
592 ÷ 512 = 1 + 80
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
512 ÷ 80 = 6 + 32
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
80 ÷ 32 = 2 + 16
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
32 ÷ 16 = 2 + 0
At this step, the remainder is zero, so we stop:
16 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,824; 2,024,912) = 16 = 24
The two numbers have common prime factors