Divisors of 11466: All 36 Factors

Quick Answer

11466 has 36 divisors (factors): 1, 2, 3, 6, 7, 9, 13, 14, 18, 21, 26, 39, 42, 49, 63, 78, 91, 98, 117, 126, 147, 182, 234, 273, 294, 441, 546, 637, 819, 882, 1274, 1638, 1911, 3822, 5733, 11466.

Sum: 31122.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 3, 6, 7, 9, 13, 14, 18, 21, 26, 39, 42, 49, 63, 78, 91, 98, 117, 126, 147, 182, 234, 273, 294, 441, 546, 637, 819, 882, 1274, 1638, 1911, 3822, 5733, 11466

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 11466

The number 11466 has 36 divisors:

1,  2,  3,  6,  7,  9,  13,  14,  18,  21,  26,  39,  42,  49,  63,  78,  91,  98,  117,  126,  147,  182,  234,  273,  294,  441,  546,  637,  819,  882,  1274,  1638,  1911,  3822,  5733,  11466

Divisor Pairs of 11466

Each pair multiplies to 11466:

Factor 1×Factor 2=Product
1×11466=11466
2×5733=11466
3×3822=11466
6×1911=11466
7×1638=11466
9×1274=11466
13×882=11466
14×819=11466
18×637=11466
21×546=11466
26×441=11466
39×294=11466
42×273=11466
49×234=11466
63×182=11466
78×147=11466
91×126=11466
98×117=11466

Number of Divisors

The number 11466 has 36 divisors, written as τ(11466) = 36 in number theory.

Sum of Divisors

σ(11466) = 1 + 2 + 3 + 6 + 7 + 9 + 13 + 14 + 18 + 21 + 26 + 39 + 42 + 49 + 63 + 78 + 91 + 98 + 117 + 126 + 147 + 182 + 234 + 273 + 294 + 441 + 546 + 637 + 819 + 882 + 1274 + 1638 + 1911 + 3822 + 5733 + 11466 = 31122

Properties of 11466

  • 11466 is composite.
  • 11466 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 31122.

Common Divisors with Another Number?

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

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

  1. 1 divides 11466 (11466 ÷ 1 = 11466) → pair (1, 11466)
  2. 2 divides 11466 (11466 ÷ 2 = 5733) → pair (2, 5733)
  3. 3 divides 11466 (11466 ÷ 3 = 3822) → pair (3, 3822)
  4. 6 divides 11466 (11466 ÷ 6 = 1911) → pair (6, 1911)
  5. 7 divides 11466 (11466 ÷ 7 = 1638) → pair (7, 1638)
  6. 9 divides 11466 (11466 ÷ 9 = 1274) → pair (9, 1274)
  7. 13 divides 11466 (11466 ÷ 13 = 882) → pair (13, 882)
  8. 14 divides 11466 (11466 ÷ 14 = 819) → pair (14, 819)
  9. 18 divides 11466 (11466 ÷ 18 = 637) → pair (18, 637)
  10. 21 divides 11466 (11466 ÷ 21 = 546) → pair (21, 546)
  11. 26 divides 11466 (11466 ÷ 26 = 441) → pair (26, 441)
  12. 39 divides 11466 (11466 ÷ 39 = 294) → pair (39, 294)
  13. 42 divides 11466 (11466 ÷ 42 = 273) → pair (42, 273)
  14. 49 divides 11466 (11466 ÷ 49 = 234) → pair (49, 234)
  15. 63 divides 11466 (11466 ÷ 63 = 182) → pair (63, 182)
  16. 78 divides 11466 (11466 ÷ 78 = 147) → pair (78, 147)
  17. 91 divides 11466 (11466 ÷ 91 = 126) → pair (91, 126)
  18. 98 divides 11466 (11466 ÷ 98 = 117) → pair (98, 117)
  19. Collect all unique values: {1, 2, 3, 6, 7, 9, 13, 14, 18, 21, 26, 39, 42, 49, 63, 78, 91, 98, 117, 126, 147, 182, 234, 273, 294, 441, 546, 637, 819, 882, 1274, 1638, 1911, 3822, 5733, 11466} — total 36 divisors.
  20. Sum: 1 + 2 + 3 + 6 + 7 + 9 + 13 + 14 + 18 + 21 + 26 + 39 + 42 + 49 + 63 + 78 + 91 + 98 + 117 + 126 + 147 + 182 + 234 + 273 + 294 + 441 + 546 + 637 + 819 + 882 + 1274 + 1638 + 1911 + 3822 + 5733 + 11466 = 31122.

Nearby Examples

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

Related Operations for 11466

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