Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,982; 2,024,968) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,982 = 2 × 3 × 757 × 1,321
5,999,982 is not a prime number but a composite one.
2,024,968 = 23 × 11 × 23,011
2,024,968 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,982 ÷ 2,024,968 = 2 + 1,950,046
Step 2. Divide the smaller number by the above operation's remainder:
2,024,968 ÷ 1,950,046 = 1 + 74,922
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,046 ÷ 74,922 = 26 + 2,074
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,922 ÷ 2,074 = 36 + 258
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
2,074 ÷ 258 = 8 + 10
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
258 ÷ 10 = 25 + 8
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
10 ÷ 8 = 1 + 2
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8 ÷ 2 = 4 + 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,982; 2,024,968) = 2
The two numbers have common prime factors