Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,441; 2,024,971) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,441 = 7 × 53 × 103 × 157
5,999,441 is not a prime number but a composite one.
2,024,971 = 13 × 53 × 2,939
2,024,971 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,441 ÷ 2,024,971 = 2 + 1,949,499
Step 2. Divide the smaller number by the above operation's remainder:
2,024,971 ÷ 1,949,499 = 1 + 75,472
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,499 ÷ 75,472 = 25 + 62,699
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,472 ÷ 62,699 = 1 + 12,773
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
62,699 ÷ 12,773 = 4 + 11,607
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
12,773 ÷ 11,607 = 1 + 1,166
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
11,607 ÷ 1,166 = 9 + 1,113
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,166 ÷ 1,113 = 1 + 53
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,113 ÷ 53 = 21 + 0
At this step, the remainder is zero, so we stop:
53 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,441; 2,024,971) = 53
The two numbers have common prime factors