Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,956; 2,024,950) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,956 = 22 × 103 × 14,563
5,999,956 is not a prime number but a composite one.
2,024,950 = 2 × 52 × 40,499
2,024,950 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,956 ÷ 2,024,950 = 2 + 1,950,056
Step 2. Divide the smaller number by the above operation's remainder:
2,024,950 ÷ 1,950,056 = 1 + 74,894
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,056 ÷ 74,894 = 26 + 2,812
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,894 ÷ 2,812 = 26 + 1,782
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
2,812 ÷ 1,782 = 1 + 1,030
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
1,782 ÷ 1,030 = 1 + 752
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,030 ÷ 752 = 1 + 278
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
752 ÷ 278 = 2 + 196
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
278 ÷ 196 = 1 + 82
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
196 ÷ 82 = 2 + 32
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
82 ÷ 32 = 2 + 18
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
32 ÷ 18 = 1 + 14
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
18 ÷ 14 = 1 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
14 ÷ 4 = 3 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
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,956; 2,024,950) = 2
The two numbers have common prime factors