Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,522; 2,024,948) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,522 = 2 × 1,409 × 2,129
5,999,522 is not a prime number but a composite one.
2,024,948 = 22 × 47 × 10,771
2,024,948 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,522 ÷ 2,024,948 = 2 + 1,949,626
Step 2. Divide the smaller number by the above operation's remainder:
2,024,948 ÷ 1,949,626 = 1 + 75,322
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,626 ÷ 75,322 = 25 + 66,576
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,322 ÷ 66,576 = 1 + 8,746
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
66,576 ÷ 8,746 = 7 + 5,354
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
8,746 ÷ 5,354 = 1 + 3,392
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
5,354 ÷ 3,392 = 1 + 1,962
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,392 ÷ 1,962 = 1 + 1,430
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,962 ÷ 1,430 = 1 + 532
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,430 ÷ 532 = 2 + 366
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
532 ÷ 366 = 1 + 166
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
366 ÷ 166 = 2 + 34
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
166 ÷ 34 = 4 + 30
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
34 ÷ 30 = 1 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
30 ÷ 4 = 7 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
4 ÷ 2 = 2 + 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 (5,999,522; 2,024,948) = 2
The two numbers have common prime factors