Divisors of 16590: All 32 Factors

Quick Answer

16590 has 32 divisors (factors): 1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 79, 105, 158, 210, 237, 395, 474, 553, 790, 1106, 1185, 1659, 2370, 2765, 3318, 5530, 8295, 16590.

Sum: 46080.

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, 79, 105, 158, 210, 237, 395, 474, 553, 790, 1106, 1185, 1659, 2370, 2765, 3318, 5530, 8295, 16590

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 16590

The number 16590 has 32 divisors:

1,  2,  3,  5,  6,  7,  10,  14,  15,  21,  30,  35,  42,  70,  79,  105,  158,  210,  237,  395,  474,  553,  790,  1106,  1185,  1659,  2370,  2765,  3318,  5530,  8295,  16590

Divisor Pairs of 16590

Each pair multiplies to 16590:

Factor 1×Factor 2=Product
1×16590=16590
2×8295=16590
3×5530=16590
5×3318=16590
6×2765=16590
7×2370=16590
10×1659=16590
14×1185=16590
15×1106=16590
21×790=16590
30×553=16590
35×474=16590
42×395=16590
70×237=16590
79×210=16590
105×158=16590

Number of Divisors

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

Sum of Divisors

σ(16590) = 1 + 2 + 3 + 5 + 6 + 7 + 10 + 14 + 15 + 21 + 30 + 35 + 42 + 70 + 79 + 105 + 158 + 210 + 237 + 395 + 474 + 553 + 790 + 1106 + 1185 + 1659 + 2370 + 2765 + 3318 + 5530 + 8295 + 16590 = 46080

Properties of 16590

  • 16590 is composite.
  • 16590 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 46080.

Common Divisors with Another Number?

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

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

  1. 1 divides 16590 (16590 ÷ 1 = 16590) → pair (1, 16590)
  2. 2 divides 16590 (16590 ÷ 2 = 8295) → pair (2, 8295)
  3. 3 divides 16590 (16590 ÷ 3 = 5530) → pair (3, 5530)
  4. 5 divides 16590 (16590 ÷ 5 = 3318) → pair (5, 3318)
  5. 6 divides 16590 (16590 ÷ 6 = 2765) → pair (6, 2765)
  6. 7 divides 16590 (16590 ÷ 7 = 2370) → pair (7, 2370)
  7. 10 divides 16590 (16590 ÷ 10 = 1659) → pair (10, 1659)
  8. 14 divides 16590 (16590 ÷ 14 = 1185) → pair (14, 1185)
  9. 15 divides 16590 (16590 ÷ 15 = 1106) → pair (15, 1106)
  10. 21 divides 16590 (16590 ÷ 21 = 790) → pair (21, 790)
  11. 30 divides 16590 (16590 ÷ 30 = 553) → pair (30, 553)
  12. 35 divides 16590 (16590 ÷ 35 = 474) → pair (35, 474)
  13. 42 divides 16590 (16590 ÷ 42 = 395) → pair (42, 395)
  14. 70 divides 16590 (16590 ÷ 70 = 237) → pair (70, 237)
  15. 79 divides 16590 (16590 ÷ 79 = 210) → pair (79, 210)
  16. 105 divides 16590 (16590 ÷ 105 = 158) → pair (105, 158)
  17. Collect all unique values: {1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 79, 105, 158, 210, 237, 395, 474, 553, 790, 1106, 1185, 1659, 2370, 2765, 3318, 5530, 8295, 16590} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 5 + 6 + 7 + 10 + 14 + 15 + 21 + 30 + 35 + 42 + 70 + 79 + 105 + 158 + 210 + 237 + 395 + 474 + 553 + 790 + 1106 + 1185 + 1659 + 2370 + 2765 + 3318 + 5530 + 8295 + 16590 = 46080.

Nearby Examples

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

Related Operations for 16590

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