Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,395; 2,024,950) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,395 = 5 × 53 × 22,643
6,000,395 is not a prime number but a composite one.
2,024,950 = 2 × 52 × 40,499
2,024,950 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,395 ÷ 2,024,950 = 2 + 1,950,495
Step 2. Divide the smaller number by the above operation's remainder:
2,024,950 ÷ 1,950,495 = 1 + 74,455
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,495 ÷ 74,455 = 26 + 14,665
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,455 ÷ 14,665 = 5 + 1,130
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
14,665 ÷ 1,130 = 12 + 1,105
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
1,130 ÷ 1,105 = 1 + 25
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,105 ÷ 25 = 44 + 5
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
25 ÷ 5 = 5 + 0
At this step, the remainder is zero, so we stop:
5 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,395; 2,024,950) = 5
The two numbers have common prime factors