Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (144,506; 12,412,514) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
144,506 = 2 × 72,253
144,506 is not a prime number but a composite one.
12,412,514 = 2 × 6,206,257
12,412,514 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,514 ÷ 144,506 = 85 + 129,504
Step 2. Divide the smaller number by the above operation's remainder:
144,506 ÷ 129,504 = 1 + 15,002
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
129,504 ÷ 15,002 = 8 + 9,488
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
15,002 ÷ 9,488 = 1 + 5,514
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
9,488 ÷ 5,514 = 1 + 3,974
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
5,514 ÷ 3,974 = 1 + 1,540
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,974 ÷ 1,540 = 2 + 894
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,540 ÷ 894 = 1 + 646
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
894 ÷ 646 = 1 + 248
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
646 ÷ 248 = 2 + 150
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
248 ÷ 150 = 1 + 98
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
150 ÷ 98 = 1 + 52
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
98 ÷ 52 = 1 + 46
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
52 ÷ 46 = 1 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
46 ÷ 6 = 7 + 4
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
6 ÷ 4 = 1 + 2
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
4 ÷ 2 = 2 + 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 (144,506; 12,412,514) = 2
The two numbers have common prime factors