Divisors of 48510: All 72 Factors

Quick Answer

48510 has 72 divisors (factors): 1, 2, 3, 5, 6, 7, 9, 10, 11, 14, 15, 18, 21, 22, 30, 33, 35, 42, 45, 49, 55, 63, 66, 70, 77, 90, 98, 99, 105, 110, 126, 147, 154, 165, 198, 210, 231, 245, 294, 315, 330, 385, 441, 462, 490, 495, 539, 630, 693, 735, 770, 882, 990, 1078, 1155, 1386, 1470, 1617, 2205, 2310, 2695, 3234, 3465, 4410, 4851, 5390, 6930, 8085, 9702, 16170, 24255, 48510.

Sum: 160056.

Divisors (Factors) Calculator

Divisors Multiples Prime Factoriz. GCF LCM

  Ex.: 12, 36, 100, 1024, 1728, etc.
72 divisors
1, 2, 3, 5, 6, 7, 9, 10, 11, 14, 15, 18, 21, 22, 30, 33, 35, 42, 45, 49, 55, 63, 66, 70, 77, 90, 98, 99, 105, 110, 126, 147, 154, 165, 198, 210, 231, 245, 294, 315, 330, 385, 441, 462, 490, 495, 539, 630, 693, 735, 770, 882, 990, 1078, 1155, 1386, 1470, 1617, 2205, 2310, 2695, 3234, 3465, 4410, 4851, 5390, 6930, 8085, 9702, 16170, 24255, 48510

Found an error? Contact us.

Use the calculator above to find all divisors (also called factors) of any positive integer up to 4,782,969. Beyond the divisor list, this tool also shows divisor pairs, the sum and count of divisors, prime factorization, and number properties (prime, perfect square, perfect number).

All Divisors of 48510

The number 48510 has 72 divisors:

1,  2,  3,  5,  6,  7,  9,  10,  11,  14,  15,  18,  21,  22,  30,  33,  35,  42,  45,  49,  55,  63,  66,  70,  77,  90,  98,  99,  105,  110,  126,  147,  154,  165,  198,  210,  231,  245,  294,  315,  330,  385,  441,  462,  490,  495,  539,  630,  693,  735,  770,  882,  990,  1078,  1155,  1386,  1470,  1617,  2205,  2310,  2695,  3234,  3465,  4410,  4851,  5390,  6930,  8085,  9702,  16170,  24255,  48510

Divisor Pairs of 48510

Each pair multiplies to 48510:

Factor 1×Factor 2=Product
1×48510=48510
2×24255=48510
3×16170=48510
5×9702=48510
6×8085=48510
7×6930=48510
9×5390=48510
10×4851=48510
11×4410=48510
14×3465=48510
15×3234=48510
18×2695=48510
21×2310=48510
22×2205=48510
30×1617=48510
33×1470=48510
35×1386=48510
42×1155=48510
45×1078=48510
49×990=48510
55×882=48510
63×770=48510
66×735=48510
70×693=48510
77×630=48510
90×539=48510
98×495=48510
99×490=48510
105×462=48510
110×441=48510
126×385=48510
147×330=48510
154×315=48510
165×294=48510
198×245=48510
210×231=48510

Number of Divisors

The number 48510 has 72 divisors, written as τ(48510) = 72 in number theory.

Sum of Divisors

σ(48510) = 1 + 2 + 3 + 5 + 6 + 7 + 9 + 10 + 11 + 14 + 15 + 18 + 21 + 22 + 30 + 33 + 35 + 42 + 45 + 49 + 55 + 63 + 66 + 70 + 77 + 90 + 98 + 99 + 105 + 110 + 126 + 147 + 154 + 165 + 198 + 210 + 231 + 245 + 294 + 315 + 330 + 385 + 441 + 462 + 490 + 495 + 539 + 630 + 693 + 735 + 770 + 882 + 990 + 1078 + 1155 + 1386 + 1470 + 1617 + 2205 + 2310 + 2695 + 3234 + 3465 + 4410 + 4851 + 5390 + 6930 + 8085 + 9702 + 16170 + 24255 + 48510 = 160056

Prime Factorization of 48510

See the full prime factorization calculator →

Properties of 48510

  • 48510 is composite.
  • 48510 is not a perfect square.
  • Number of divisors: 72.
  • Sum of divisors: 160056.

Common Divisors with Another Number?

Looking for the divisors that 48510 shares with another number? Use our Greatest Common Factor (GCF) calculator — it finds all common divisors and the largest one.

Step-by-Step: How to Find the Divisors of 48510

An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √48510 ≈ 220.25. If i divides 48510, then both i and 48510/i are divisors.

  1. 1 divides 48510 (48510 ÷ 1 = 48510) → pair (1, 48510)
  2. 2 divides 48510 (48510 ÷ 2 = 24255) → pair (2, 24255)
  3. 3 divides 48510 (48510 ÷ 3 = 16170) → pair (3, 16170)
  4. 5 divides 48510 (48510 ÷ 5 = 9702) → pair (5, 9702)
  5. 6 divides 48510 (48510 ÷ 6 = 8085) → pair (6, 8085)
  6. 7 divides 48510 (48510 ÷ 7 = 6930) → pair (7, 6930)
  7. 9 divides 48510 (48510 ÷ 9 = 5390) → pair (9, 5390)
  8. 10 divides 48510 (48510 ÷ 10 = 4851) → pair (10, 4851)
  9. 11 divides 48510 (48510 ÷ 11 = 4410) → pair (11, 4410)
  10. 14 divides 48510 (48510 ÷ 14 = 3465) → pair (14, 3465)
  11. 15 divides 48510 (48510 ÷ 15 = 3234) → pair (15, 3234)
  12. 18 divides 48510 (48510 ÷ 18 = 2695) → pair (18, 2695)
  13. 21 divides 48510 (48510 ÷ 21 = 2310) → pair (21, 2310)
  14. 22 divides 48510 (48510 ÷ 22 = 2205) → pair (22, 2205)
  15. 30 divides 48510 (48510 ÷ 30 = 1617) → pair (30, 1617)
  16. 33 divides 48510 (48510 ÷ 33 = 1470) → pair (33, 1470)
  17. 35 divides 48510 (48510 ÷ 35 = 1386) → pair (35, 1386)
  18. 42 divides 48510 (48510 ÷ 42 = 1155) → pair (42, 1155)
  19. 45 divides 48510 (48510 ÷ 45 = 1078) → pair (45, 1078)
  20. 49 divides 48510 (48510 ÷ 49 = 990) → pair (49, 990)
  21. 55 divides 48510 (48510 ÷ 55 = 882) → pair (55, 882)
  22. 63 divides 48510 (48510 ÷ 63 = 770) → pair (63, 770)
  23. 66 divides 48510 (48510 ÷ 66 = 735) → pair (66, 735)
  24. 70 divides 48510 (48510 ÷ 70 = 693) → pair (70, 693)
  25. 77 divides 48510 (48510 ÷ 77 = 630) → pair (77, 630)
  26. 90 divides 48510 (48510 ÷ 90 = 539) → pair (90, 539)
  27. 98 divides 48510 (48510 ÷ 98 = 495) → pair (98, 495)
  28. 99 divides 48510 (48510 ÷ 99 = 490) → pair (99, 490)
  29. 105 divides 48510 (48510 ÷ 105 = 462) → pair (105, 462)
  30. 110 divides 48510 (48510 ÷ 110 = 441) → pair (110, 441)
  31. 126 divides 48510 (48510 ÷ 126 = 385) → pair (126, 385)
  32. 147 divides 48510 (48510 ÷ 147 = 330) → pair (147, 330)
  33. 154 divides 48510 (48510 ÷ 154 = 315) → pair (154, 315)
  34. 165 divides 48510 (48510 ÷ 165 = 294) → pair (165, 294)
  35. 198 divides 48510 (48510 ÷ 198 = 245) → pair (198, 245)
  36. 210 divides 48510 (48510 ÷ 210 = 231) → pair (210, 231)
  37. Collect all unique values: {1, 2, 3, 5, 6, 7, 9, 10, 11, 14, 15, 18, 21, 22, 30, 33, 35, 42, 45, 49, 55, 63, 66, 70, 77, 90, 98, 99, 105, 110, 126, 147, 154, 165, 198, 210, 231, 245, 294, 315, 330, 385, 441, 462, 490, 495, 539, 630, 693, 735, 770, 882, 990, 1078, 1155, 1386, 1470, 1617, 2205, 2310, 2695, 3234, 3465, 4410, 4851, 5390, 6930, 8085, 9702, 16170, 24255, 48510} — total 72 divisors.
  38. Sum: 1 + 2 + 3 + 5 + 6 + 7 + 9 + 10 + 11 + 14 + 15 + 18 + 21 + 22 + 30 + 33 + 35 + 42 + 45 + 49 + 55 + 63 + 66 + 70 + 77 + 90 + 98 + 99 + 105 + 110 + 126 + 147 + 154 + 165 + 198 + 210 + 231 + 245 + 294 + 315 + 330 + 385 + 441 + 462 + 490 + 495 + 539 + 630 + 693 + 735 + 770 + 882 + 990 + 1078 + 1155 + 1386 + 1470 + 1617 + 2205 + 2310 + 2695 + 3234 + 3465 + 4410 + 4851 + 5390 + 6930 + 8085 + 9702 + 16170 + 24255 + 48510 = 160056.

Nearby Examples

ndivisors countsum σ(n)
360241170
24020744
18018546
14415403
12016360
1009217
9012234
8412224

Related Operations for 48510

See also our tables of divisors:

What Is a Divisor?

A divisor (also called a factor) of a positive integer n is any positive integer d such that n ÷ d has no remainder. In other words, d divides n evenly.

Every positive integer n has at least two divisors: 1 and n itself (with 1 being the trivial case of having only itself). Numbers with exactly 2 divisors are prime; numbers with 3 or more divisors are composite.

Why use this calculator? Beyond just listing divisors, this tool computes the sum σ(n), the count τ(n), prime factorization, divisor pairs (useful for visual learners and factoring problems), and detects whether n is a prime, a perfect square, or a perfect number.

References

Divisors Calculation Examples

Find all divisors of these numbers:

1,2698 div1,4532 div1,75216 div1,86212 div1,9664 div26012 div74812 div1,1858 div1,30216 div3584 div1,9708 div2,0236 div

Related Calculators