Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,958; 2,024,907) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,958 = 2 × 32 × 333,331
5,999,958 is not a prime number but a composite one.
2,024,907 = 3 × 677 × 997
2,024,907 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,958 ÷ 2,024,907 = 2 + 1,950,144
Step 2. Divide the smaller number by the above operation's remainder:
2,024,907 ÷ 1,950,144 = 1 + 74,763
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,144 ÷ 74,763 = 26 + 6,306
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,763 ÷ 6,306 = 11 + 5,397
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
6,306 ÷ 5,397 = 1 + 909
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
5,397 ÷ 909 = 5 + 852
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
909 ÷ 852 = 1 + 57
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
852 ÷ 57 = 14 + 54
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
57 ÷ 54 = 1 + 3
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
54 ÷ 3 = 18 + 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,958; 2,024,907) = 3
The two numbers have common prime factors