Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,682; 2,024,945) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,682 = 2 × 3 × 13 × 76,919
5,999,682 is not a prime number but a composite one.
2,024,945 = 5 × 13 × 31,153
2,024,945 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,682 ÷ 2,024,945 = 2 + 1,949,792
Step 2. Divide the smaller number by the above operation's remainder:
2,024,945 ÷ 1,949,792 = 1 + 75,153
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,792 ÷ 75,153 = 25 + 70,967
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,153 ÷ 70,967 = 1 + 4,186
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
70,967 ÷ 4,186 = 16 + 3,991
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
4,186 ÷ 3,991 = 1 + 195
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,991 ÷ 195 = 20 + 91
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
195 ÷ 91 = 2 + 13
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
91 ÷ 13 = 7 + 0
At this step, the remainder is zero, so we stop:
13 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,682; 2,024,945) = 13
The two numbers have common prime factors