Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (144,510; 12,412,506) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
144,510 = 2 × 3 × 5 × 4,817
144,510 is not a prime number but a composite one.
12,412,506 = 2 × 3 × 2,068,751
12,412,506 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:
12,412,506 ÷ 144,510 = 85 + 129,156
Step 2. Divide the smaller number by the above operation's remainder:
144,510 ÷ 129,156 = 1 + 15,354
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
129,156 ÷ 15,354 = 8 + 6,324
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
15,354 ÷ 6,324 = 2 + 2,706
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
6,324 ÷ 2,706 = 2 + 912
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
2,706 ÷ 912 = 2 + 882
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
912 ÷ 882 = 1 + 30
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
882 ÷ 30 = 29 + 12
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
30 ÷ 12 = 2 + 6
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
12 ÷ 6 = 2 + 0
At this step, the remainder is zero, so we stop:
6 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 (144,510; 12,412,506) = 6 = 2 × 3
The two numbers have common prime factors