Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,590; 13,249,950) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,590 = 2 × 5 × 659
6,590 is not a prime number but a composite one.
13,249,950 = 2 × 3 × 52 × 7 × 12,619
13,249,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:
13,249,950 ÷ 6,590 = 2,010 + 4,050
Step 2. Divide the smaller number by the above operation's remainder:
6,590 ÷ 4,050 = 1 + 2,540
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
4,050 ÷ 2,540 = 1 + 1,510
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
2,540 ÷ 1,510 = 1 + 1,030
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
1,510 ÷ 1,030 = 1 + 480
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
1,030 ÷ 480 = 2 + 70
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
480 ÷ 70 = 6 + 60
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
70 ÷ 60 = 1 + 10
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
60 ÷ 10 = 6 + 0
At this step, the remainder is zero, so we stop:
10 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,590; 13,249,950) = 10 = 2 × 5
The two numbers have common prime factors