Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,697; 2,024,913) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,697 = 33 × 11 × 20,201
5,999,697 is not a prime number but a composite one.
2,024,913 = 3 × 11 × 43 × 1,427
2,024,913 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,697 ÷ 2,024,913 = 2 + 1,949,871
Step 2. Divide the smaller number by the above operation's remainder:
2,024,913 ÷ 1,949,871 = 1 + 75,042
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,871 ÷ 75,042 = 25 + 73,821
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,042 ÷ 73,821 = 1 + 1,221
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
73,821 ÷ 1,221 = 60 + 561
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
1,221 ÷ 561 = 2 + 99
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
561 ÷ 99 = 5 + 66
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
99 ÷ 66 = 1 + 33
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
66 ÷ 33 = 2 + 0
At this step, the remainder is zero, so we stop:
33 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,697; 2,024,913) = 33 = 3 × 11
The two numbers have common prime factors