Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,769; 2,024,939) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,769 = 32 × 59 × 11,299
5,999,769 is not a prime number but a composite one.
2,024,939 = 7 × 59 × 4,903
2,024,939 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,769 ÷ 2,024,939 = 2 + 1,949,891
Step 2. Divide the smaller number by the above operation's remainder:
2,024,939 ÷ 1,949,891 = 1 + 75,048
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,891 ÷ 75,048 = 25 + 73,691
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,048 ÷ 73,691 = 1 + 1,357
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
73,691 ÷ 1,357 = 54 + 413
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
1,357 ÷ 413 = 3 + 118
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
413 ÷ 118 = 3 + 59
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
118 ÷ 59 = 2 + 0
At this step, the remainder is zero, so we stop:
59 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,769; 2,024,939) = 59
The two numbers have common prime factors