Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,284; 2,024,966) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,284 = 22 × 1,500,071
6,000,284 is not a prime number but a composite one.
2,024,966 = 2 × 23 × 44,021
2,024,966 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,284 ÷ 2,024,966 = 2 + 1,950,352
Step 2. Divide the smaller number by the above operation's remainder:
2,024,966 ÷ 1,950,352 = 1 + 74,614
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,352 ÷ 74,614 = 26 + 10,388
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,614 ÷ 10,388 = 7 + 1,898
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
10,388 ÷ 1,898 = 5 + 898
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
1,898 ÷ 898 = 2 + 102
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
898 ÷ 102 = 8 + 82
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
102 ÷ 82 = 1 + 20
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
82 ÷ 20 = 4 + 2
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
20 ÷ 2 = 10 + 0
At this step, the remainder is zero, so we stop:
2 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,284; 2,024,966) = 2
The two numbers have common prime factors