Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,505; 2,024,932) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,505 = 5 × 7 × 173 × 991
6,000,505 is not a prime number but a composite one.
2,024,932 = 22 × 7 × 13 × 5,563
2,024,932 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:
6,000,505 ÷ 2,024,932 = 2 + 1,950,641
Step 2. Divide the smaller number by the above operation's remainder:
2,024,932 ÷ 1,950,641 = 1 + 74,291
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,641 ÷ 74,291 = 26 + 19,075
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,291 ÷ 19,075 = 3 + 17,066
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
19,075 ÷ 17,066 = 1 + 2,009
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
17,066 ÷ 2,009 = 8 + 994
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,009 ÷ 994 = 2 + 21
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
994 ÷ 21 = 47 + 7
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
21 ÷ 7 = 3 + 0
At this step, the remainder is zero, so we stop:
7 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 (6,000,505; 2,024,932) = 7
The two numbers have common prime factors