Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,943; 2,024,931) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,943 = 3 × 73 × 27,397
5,999,943 is not a prime number but a composite one.
2,024,931 = 3 × 674,977
2,024,931 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,943 ÷ 2,024,931 = 2 + 1,950,081
Step 2. Divide the smaller number by the above operation's remainder:
2,024,931 ÷ 1,950,081 = 1 + 74,850
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,081 ÷ 74,850 = 26 + 3,981
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,850 ÷ 3,981 = 18 + 3,192
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
3,981 ÷ 3,192 = 1 + 789
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
3,192 ÷ 789 = 4 + 36
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
789 ÷ 36 = 21 + 33
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
36 ÷ 33 = 1 + 3
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
33 ÷ 3 = 11 + 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,943; 2,024,931) = 3
The two numbers have common prime factors