Divisors of 11136: All 32 Factors

Quick Answer

11136 has 32 divisors (factors): 1, 2, 3, 4, 6, 8, 12, 16, 24, 29, 32, 48, 58, 64, 87, 96, 116, 128, 174, 192, 232, 348, 384, 464, 696, 928, 1392, 1856, 2784, 3712, 5568, 11136.

Sum: 30600.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 4, 6, 8, 12, 16, 24, 29, 32, 48, 58, 64, 87, 96, 116, 128, 174, 192, 232, 348, 384, 464, 696, 928, 1392, 1856, 2784, 3712, 5568, 11136

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 11136

The number 11136 has 32 divisors:

1,  2,  3,  4,  6,  8,  12,  16,  24,  29,  32,  48,  58,  64,  87,  96,  116,  128,  174,  192,  232,  348,  384,  464,  696,  928,  1392,  1856,  2784,  3712,  5568,  11136

Divisor Pairs of 11136

Each pair multiplies to 11136:

Factor 1×Factor 2=Product
1×11136=11136
2×5568=11136
3×3712=11136
4×2784=11136
6×1856=11136
8×1392=11136
12×928=11136
16×696=11136
24×464=11136
29×384=11136
32×348=11136
48×232=11136
58×192=11136
64×174=11136
87×128=11136
96×116=11136

Number of Divisors

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

Sum of Divisors

σ(11136) = 1 + 2 + 3 + 4 + 6 + 8 + 12 + 16 + 24 + 29 + 32 + 48 + 58 + 64 + 87 + 96 + 116 + 128 + 174 + 192 + 232 + 348 + 384 + 464 + 696 + 928 + 1392 + 1856 + 2784 + 3712 + 5568 + 11136 = 30600

Properties of 11136

  • 11136 is composite.
  • 11136 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 30600.

Common Divisors with Another Number?

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

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

  1. 1 divides 11136 (11136 ÷ 1 = 11136) → pair (1, 11136)
  2. 2 divides 11136 (11136 ÷ 2 = 5568) → pair (2, 5568)
  3. 3 divides 11136 (11136 ÷ 3 = 3712) → pair (3, 3712)
  4. 4 divides 11136 (11136 ÷ 4 = 2784) → pair (4, 2784)
  5. 6 divides 11136 (11136 ÷ 6 = 1856) → pair (6, 1856)
  6. 8 divides 11136 (11136 ÷ 8 = 1392) → pair (8, 1392)
  7. 12 divides 11136 (11136 ÷ 12 = 928) → pair (12, 928)
  8. 16 divides 11136 (11136 ÷ 16 = 696) → pair (16, 696)
  9. 24 divides 11136 (11136 ÷ 24 = 464) → pair (24, 464)
  10. 29 divides 11136 (11136 ÷ 29 = 384) → pair (29, 384)
  11. 32 divides 11136 (11136 ÷ 32 = 348) → pair (32, 348)
  12. 48 divides 11136 (11136 ÷ 48 = 232) → pair (48, 232)
  13. 58 divides 11136 (11136 ÷ 58 = 192) → pair (58, 192)
  14. 64 divides 11136 (11136 ÷ 64 = 174) → pair (64, 174)
  15. 87 divides 11136 (11136 ÷ 87 = 128) → pair (87, 128)
  16. 96 divides 11136 (11136 ÷ 96 = 116) → pair (96, 116)
  17. Collect all unique values: {1, 2, 3, 4, 6, 8, 12, 16, 24, 29, 32, 48, 58, 64, 87, 96, 116, 128, 174, 192, 232, 348, 384, 464, 696, 928, 1392, 1856, 2784, 3712, 5568, 11136} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 4 + 6 + 8 + 12 + 16 + 24 + 29 + 32 + 48 + 58 + 64 + 87 + 96 + 116 + 128 + 174 + 192 + 232 + 348 + 384 + 464 + 696 + 928 + 1392 + 1856 + 2784 + 3712 + 5568 + 11136 = 30600.

Nearby Examples

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

Related Operations for 11136

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