Divisors of 16470: All 32 Factors

Quick Answer

16470 has 32 divisors (factors): 1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 61, 90, 122, 135, 183, 270, 305, 366, 549, 610, 915, 1098, 1647, 1830, 2745, 3294, 5490, 8235, 16470.

Sum: 44640.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 61, 90, 122, 135, 183, 270, 305, 366, 549, 610, 915, 1098, 1647, 1830, 2745, 3294, 5490, 8235, 16470

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 16470

The number 16470 has 32 divisors:

1,  2,  3,  5,  6,  9,  10,  15,  18,  27,  30,  45,  54,  61,  90,  122,  135,  183,  270,  305,  366,  549,  610,  915,  1098,  1647,  1830,  2745,  3294,  5490,  8235,  16470

Divisor Pairs of 16470

Each pair multiplies to 16470:

Factor 1×Factor 2=Product
1×16470=16470
2×8235=16470
3×5490=16470
5×3294=16470
6×2745=16470
9×1830=16470
10×1647=16470
15×1098=16470
18×915=16470
27×610=16470
30×549=16470
45×366=16470
54×305=16470
61×270=16470
90×183=16470
122×135=16470

Number of Divisors

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

Sum of Divisors

σ(16470) = 1 + 2 + 3 + 5 + 6 + 9 + 10 + 15 + 18 + 27 + 30 + 45 + 54 + 61 + 90 + 122 + 135 + 183 + 270 + 305 + 366 + 549 + 610 + 915 + 1098 + 1647 + 1830 + 2745 + 3294 + 5490 + 8235 + 16470 = 44640

Properties of 16470

  • 16470 is composite.
  • 16470 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 44640.

Common Divisors with Another Number?

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

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

  1. 1 divides 16470 (16470 ÷ 1 = 16470) → pair (1, 16470)
  2. 2 divides 16470 (16470 ÷ 2 = 8235) → pair (2, 8235)
  3. 3 divides 16470 (16470 ÷ 3 = 5490) → pair (3, 5490)
  4. 5 divides 16470 (16470 ÷ 5 = 3294) → pair (5, 3294)
  5. 6 divides 16470 (16470 ÷ 6 = 2745) → pair (6, 2745)
  6. 9 divides 16470 (16470 ÷ 9 = 1830) → pair (9, 1830)
  7. 10 divides 16470 (16470 ÷ 10 = 1647) → pair (10, 1647)
  8. 15 divides 16470 (16470 ÷ 15 = 1098) → pair (15, 1098)
  9. 18 divides 16470 (16470 ÷ 18 = 915) → pair (18, 915)
  10. 27 divides 16470 (16470 ÷ 27 = 610) → pair (27, 610)
  11. 30 divides 16470 (16470 ÷ 30 = 549) → pair (30, 549)
  12. 45 divides 16470 (16470 ÷ 45 = 366) → pair (45, 366)
  13. 54 divides 16470 (16470 ÷ 54 = 305) → pair (54, 305)
  14. 61 divides 16470 (16470 ÷ 61 = 270) → pair (61, 270)
  15. 90 divides 16470 (16470 ÷ 90 = 183) → pair (90, 183)
  16. 122 divides 16470 (16470 ÷ 122 = 135) → pair (122, 135)
  17. Collect all unique values: {1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 61, 90, 122, 135, 183, 270, 305, 366, 549, 610, 915, 1098, 1647, 1830, 2745, 3294, 5490, 8235, 16470} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 5 + 6 + 9 + 10 + 15 + 18 + 27 + 30 + 45 + 54 + 61 + 90 + 122 + 135 + 183 + 270 + 305 + 366 + 549 + 610 + 915 + 1098 + 1647 + 1830 + 2745 + 3294 + 5490 + 8235 + 16470 = 44640.

Nearby Examples

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

Related Operations for 16470

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