Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,676; 2,024,936) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,676 = 22 × 3 × 499,973
5,999,676 is not a prime number but a composite one.
2,024,936 = 23 × 37 × 6,841
2,024,936 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,676 ÷ 2,024,936 = 2 + 1,949,804
Step 2. Divide the smaller number by the above operation's remainder:
2,024,936 ÷ 1,949,804 = 1 + 75,132
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,804 ÷ 75,132 = 25 + 71,504
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,132 ÷ 71,504 = 1 + 3,628
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
71,504 ÷ 3,628 = 19 + 2,572
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
3,628 ÷ 2,572 = 1 + 1,056
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,572 ÷ 1,056 = 2 + 460
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,056 ÷ 460 = 2 + 136
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
460 ÷ 136 = 3 + 52
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
136 ÷ 52 = 2 + 32
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
52 ÷ 32 = 1 + 20
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
32 ÷ 20 = 1 + 12
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
20 ÷ 12 = 1 + 8
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
12 ÷ 8 = 1 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
8 ÷ 4 = 2 + 0
At this step, the remainder is zero, so we stop:
4 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,676; 2,024,936) = 4 = 22
The two numbers have common prime factors