Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,418; 2,024,924) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,418 = 2 × 32 × 79 × 4,219
5,999,418 is not a prime number but a composite one.
2,024,924 = 22 × 11 × 46,021
2,024,924 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,418 ÷ 2,024,924 = 2 + 1,949,570
Step 2. Divide the smaller number by the above operation's remainder:
2,024,924 ÷ 1,949,570 = 1 + 75,354
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,570 ÷ 75,354 = 25 + 65,720
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,354 ÷ 65,720 = 1 + 9,634
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
65,720 ÷ 9,634 = 6 + 7,916
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
9,634 ÷ 7,916 = 1 + 1,718
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
7,916 ÷ 1,718 = 4 + 1,044
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,718 ÷ 1,044 = 1 + 674
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,044 ÷ 674 = 1 + 370
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
674 ÷ 370 = 1 + 304
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
370 ÷ 304 = 1 + 66
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
304 ÷ 66 = 4 + 40
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
66 ÷ 40 = 1 + 26
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
40 ÷ 26 = 1 + 14
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
26 ÷ 14 = 1 + 12
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
14 ÷ 12 = 1 + 2
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
12 ÷ 2 = 6 + 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,418; 2,024,924) = 2
The two numbers have common prime factors