Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,626; 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,626 = 2 × 2,999,813
5,999,626 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,626 ÷ 2,024,946 = 2 + 1,949,734
Step 2. Divide the smaller number by the above operation's remainder:
2,024,946 ÷ 1,949,734 = 1 + 75,212
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,734 ÷ 75,212 = 25 + 69,434
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,212 ÷ 69,434 = 1 + 5,778
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
69,434 ÷ 5,778 = 12 + 98
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
5,778 ÷ 98 = 58 + 94
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
98 ÷ 94 = 1 + 4
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
94 ÷ 4 = 23 + 2
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
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,626; 2,024,946) = 2
The two numbers have common prime factors