Divisors of 11256: All 32 Factors

Quick Answer

11256 has 32 divisors (factors): 1, 2, 3, 4, 6, 7, 8, 12, 14, 21, 24, 28, 42, 56, 67, 84, 134, 168, 201, 268, 402, 469, 536, 804, 938, 1407, 1608, 1876, 2814, 3752, 5628, 11256.

Sum: 32640.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 4, 6, 7, 8, 12, 14, 21, 24, 28, 42, 56, 67, 84, 134, 168, 201, 268, 402, 469, 536, 804, 938, 1407, 1608, 1876, 2814, 3752, 5628, 11256

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 11256

The number 11256 has 32 divisors:

1,  2,  3,  4,  6,  7,  8,  12,  14,  21,  24,  28,  42,  56,  67,  84,  134,  168,  201,  268,  402,  469,  536,  804,  938,  1407,  1608,  1876,  2814,  3752,  5628,  11256

Divisor Pairs of 11256

Each pair multiplies to 11256:

Factor 1×Factor 2=Product
1×11256=11256
2×5628=11256
3×3752=11256
4×2814=11256
6×1876=11256
7×1608=11256
8×1407=11256
12×938=11256
14×804=11256
21×536=11256
24×469=11256
28×402=11256
42×268=11256
56×201=11256
67×168=11256
84×134=11256

Number of Divisors

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

Sum of Divisors

σ(11256) = 1 + 2 + 3 + 4 + 6 + 7 + 8 + 12 + 14 + 21 + 24 + 28 + 42 + 56 + 67 + 84 + 134 + 168 + 201 + 268 + 402 + 469 + 536 + 804 + 938 + 1407 + 1608 + 1876 + 2814 + 3752 + 5628 + 11256 = 32640

Properties of 11256

  • 11256 is composite.
  • 11256 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 32640.

Common Divisors with Another Number?

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

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

  1. 1 divides 11256 (11256 ÷ 1 = 11256) → pair (1, 11256)
  2. 2 divides 11256 (11256 ÷ 2 = 5628) → pair (2, 5628)
  3. 3 divides 11256 (11256 ÷ 3 = 3752) → pair (3, 3752)
  4. 4 divides 11256 (11256 ÷ 4 = 2814) → pair (4, 2814)
  5. 6 divides 11256 (11256 ÷ 6 = 1876) → pair (6, 1876)
  6. 7 divides 11256 (11256 ÷ 7 = 1608) → pair (7, 1608)
  7. 8 divides 11256 (11256 ÷ 8 = 1407) → pair (8, 1407)
  8. 12 divides 11256 (11256 ÷ 12 = 938) → pair (12, 938)
  9. 14 divides 11256 (11256 ÷ 14 = 804) → pair (14, 804)
  10. 21 divides 11256 (11256 ÷ 21 = 536) → pair (21, 536)
  11. 24 divides 11256 (11256 ÷ 24 = 469) → pair (24, 469)
  12. 28 divides 11256 (11256 ÷ 28 = 402) → pair (28, 402)
  13. 42 divides 11256 (11256 ÷ 42 = 268) → pair (42, 268)
  14. 56 divides 11256 (11256 ÷ 56 = 201) → pair (56, 201)
  15. 67 divides 11256 (11256 ÷ 67 = 168) → pair (67, 168)
  16. 84 divides 11256 (11256 ÷ 84 = 134) → pair (84, 134)
  17. Collect all unique values: {1, 2, 3, 4, 6, 7, 8, 12, 14, 21, 24, 28, 42, 56, 67, 84, 134, 168, 201, 268, 402, 469, 536, 804, 938, 1407, 1608, 1876, 2814, 3752, 5628, 11256} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 4 + 6 + 7 + 8 + 12 + 14 + 21 + 24 + 28 + 42 + 56 + 67 + 84 + 134 + 168 + 201 + 268 + 402 + 469 + 536 + 804 + 938 + 1407 + 1608 + 1876 + 2814 + 3752 + 5628 + 11256 = 32640.

Nearby Examples

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

Related Operations for 11256

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