Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,750; 2,024,946) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,750 = 2 × 53 × 103 × 233
5,999,750 is not a prime number but a composite one.
2,024,946 = 2 × 33 × 7 × 11 × 487
2,024,946 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,750 ÷ 2,024,946 = 2 + 1,949,858
Step 2. Divide the smaller number by the above operation's remainder:
2,024,946 ÷ 1,949,858 = 1 + 75,088
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,858 ÷ 75,088 = 25 + 72,658
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,088 ÷ 72,658 = 1 + 2,430
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
72,658 ÷ 2,430 = 29 + 2,188
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
2,430 ÷ 2,188 = 1 + 242
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,188 ÷ 242 = 9 + 10
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
242 ÷ 10 = 24 + 2
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
10 ÷ 2 = 5 + 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,750; 2,024,946) = 2
The two numbers have common prime factors