Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (532,596; 5,215,630) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
532,596 = 22 × 3 × 44,383
532,596 is not a prime number but a composite one.
5,215,630 = 2 × 5 × 7 × 74,509
5,215,630 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:
5,215,630 ÷ 532,596 = 9 + 422,266
Step 2. Divide the smaller number by the above operation's remainder:
532,596 ÷ 422,266 = 1 + 110,330
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
422,266 ÷ 110,330 = 3 + 91,276
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
110,330 ÷ 91,276 = 1 + 19,054
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
91,276 ÷ 19,054 = 4 + 15,060
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
19,054 ÷ 15,060 = 1 + 3,994
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
15,060 ÷ 3,994 = 3 + 3,078
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,994 ÷ 3,078 = 1 + 916
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,078 ÷ 916 = 3 + 330
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
916 ÷ 330 = 2 + 256
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
330 ÷ 256 = 1 + 74
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
256 ÷ 74 = 3 + 34
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
74 ÷ 34 = 2 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
34 ÷ 6 = 5 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 4 = 1 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
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 (532,596; 5,215,630) = 2
The two numbers have common prime factors