Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,694; 2,024,967) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,694 = 2 × 3 × 293 × 41
5,999,694 is not a prime number but a composite one.
2,024,967 = 3 × 7 × 211 × 457
2,024,967 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,694 ÷ 2,024,967 = 2 + 1,949,760
Step 2. Divide the smaller number by the above operation's remainder:
2,024,967 ÷ 1,949,760 = 1 + 75,207
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,760 ÷ 75,207 = 25 + 69,585
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,207 ÷ 69,585 = 1 + 5,622
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
69,585 ÷ 5,622 = 12 + 2,121
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
5,622 ÷ 2,121 = 2 + 1,380
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,121 ÷ 1,380 = 1 + 741
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,380 ÷ 741 = 1 + 639
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
741 ÷ 639 = 1 + 102
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
639 ÷ 102 = 6 + 27
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
102 ÷ 27 = 3 + 21
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
27 ÷ 21 = 1 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
21 ÷ 6 = 3 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 3 = 2 + 0
At this step, the remainder is zero, so we stop:
3 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,694; 2,024,967) = 3
The two numbers have common prime factors