Divisors of 15330: All 32 Factors

Quick Answer

15330 has 32 divisors (factors): 1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 73, 105, 146, 210, 219, 365, 438, 511, 730, 1022, 1095, 1533, 2190, 2555, 3066, 5110, 7665, 15330.

Sum: 42624.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 73, 105, 146, 210, 219, 365, 438, 511, 730, 1022, 1095, 1533, 2190, 2555, 3066, 5110, 7665, 15330

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 15330

The number 15330 has 32 divisors:

1,  2,  3,  5,  6,  7,  10,  14,  15,  21,  30,  35,  42,  70,  73,  105,  146,  210,  219,  365,  438,  511,  730,  1022,  1095,  1533,  2190,  2555,  3066,  5110,  7665,  15330

Divisor Pairs of 15330

Each pair multiplies to 15330:

Factor 1×Factor 2=Product
1×15330=15330
2×7665=15330
3×5110=15330
5×3066=15330
6×2555=15330
7×2190=15330
10×1533=15330
14×1095=15330
15×1022=15330
21×730=15330
30×511=15330
35×438=15330
42×365=15330
70×219=15330
73×210=15330
105×146=15330

Number of Divisors

The number 15330 has 32 divisors, written as τ(15330) = 32 in number theory.

Sum of Divisors

σ(15330) = 1 + 2 + 3 + 5 + 6 + 7 + 10 + 14 + 15 + 21 + 30 + 35 + 42 + 70 + 73 + 105 + 146 + 210 + 219 + 365 + 438 + 511 + 730 + 1022 + 1095 + 1533 + 2190 + 2555 + 3066 + 5110 + 7665 + 15330 = 42624

Properties of 15330

  • 15330 is composite.
  • 15330 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 42624.

Common Divisors with Another Number?

Looking for the divisors that 15330 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 15330

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

  1. 1 divides 15330 (15330 ÷ 1 = 15330) → pair (1, 15330)
  2. 2 divides 15330 (15330 ÷ 2 = 7665) → pair (2, 7665)
  3. 3 divides 15330 (15330 ÷ 3 = 5110) → pair (3, 5110)
  4. 5 divides 15330 (15330 ÷ 5 = 3066) → pair (5, 3066)
  5. 6 divides 15330 (15330 ÷ 6 = 2555) → pair (6, 2555)
  6. 7 divides 15330 (15330 ÷ 7 = 2190) → pair (7, 2190)
  7. 10 divides 15330 (15330 ÷ 10 = 1533) → pair (10, 1533)
  8. 14 divides 15330 (15330 ÷ 14 = 1095) → pair (14, 1095)
  9. 15 divides 15330 (15330 ÷ 15 = 1022) → pair (15, 1022)
  10. 21 divides 15330 (15330 ÷ 21 = 730) → pair (21, 730)
  11. 30 divides 15330 (15330 ÷ 30 = 511) → pair (30, 511)
  12. 35 divides 15330 (15330 ÷ 35 = 438) → pair (35, 438)
  13. 42 divides 15330 (15330 ÷ 42 = 365) → pair (42, 365)
  14. 70 divides 15330 (15330 ÷ 70 = 219) → pair (70, 219)
  15. 73 divides 15330 (15330 ÷ 73 = 210) → pair (73, 210)
  16. 105 divides 15330 (15330 ÷ 105 = 146) → pair (105, 146)
  17. Collect all unique values: {1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 73, 105, 146, 210, 219, 365, 438, 511, 730, 1022, 1095, 1533, 2190, 2555, 3066, 5110, 7665, 15330} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 5 + 6 + 7 + 10 + 14 + 15 + 21 + 30 + 35 + 42 + 70 + 73 + 105 + 146 + 210 + 219 + 365 + 438 + 511 + 730 + 1022 + 1095 + 1533 + 2190 + 2555 + 3066 + 5110 + 7665 + 15330 = 42624.

Nearby Examples

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

Related Operations for 15330

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.

Divisors Calculation Examples

Find all divisors of these numbers:

Related Calculators