Divisors of 15232: All 32 Factors

Quick Answer

15232 has 32 divisors (factors): 1, 2, 4, 7, 8, 14, 16, 17, 28, 32, 34, 56, 64, 68, 112, 119, 128, 136, 224, 238, 272, 448, 476, 544, 896, 952, 1088, 1904, 2176, 3808, 7616, 15232.

Sum: 36720.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 4, 7, 8, 14, 16, 17, 28, 32, 34, 56, 64, 68, 112, 119, 128, 136, 224, 238, 272, 448, 476, 544, 896, 952, 1088, 1904, 2176, 3808, 7616, 15232

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 15232

The number 15232 has 32 divisors:

1,  2,  4,  7,  8,  14,  16,  17,  28,  32,  34,  56,  64,  68,  112,  119,  128,  136,  224,  238,  272,  448,  476,  544,  896,  952,  1088,  1904,  2176,  3808,  7616,  15232

Divisor Pairs of 15232

Each pair multiplies to 15232:

Factor 1×Factor 2=Product
1×15232=15232
2×7616=15232
4×3808=15232
7×2176=15232
8×1904=15232
14×1088=15232
16×952=15232
17×896=15232
28×544=15232
32×476=15232
34×448=15232
56×272=15232
64×238=15232
68×224=15232
112×136=15232
119×128=15232

Number of Divisors

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

Sum of Divisors

σ(15232) = 1 + 2 + 4 + 7 + 8 + 14 + 16 + 17 + 28 + 32 + 34 + 56 + 64 + 68 + 112 + 119 + 128 + 136 + 224 + 238 + 272 + 448 + 476 + 544 + 896 + 952 + 1088 + 1904 + 2176 + 3808 + 7616 + 15232 = 36720

Properties of 15232

  • 15232 is composite.
  • 15232 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 36720.

Common Divisors with Another Number?

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

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

  1. 1 divides 15232 (15232 ÷ 1 = 15232) → pair (1, 15232)
  2. 2 divides 15232 (15232 ÷ 2 = 7616) → pair (2, 7616)
  3. 4 divides 15232 (15232 ÷ 4 = 3808) → pair (4, 3808)
  4. 7 divides 15232 (15232 ÷ 7 = 2176) → pair (7, 2176)
  5. 8 divides 15232 (15232 ÷ 8 = 1904) → pair (8, 1904)
  6. 14 divides 15232 (15232 ÷ 14 = 1088) → pair (14, 1088)
  7. 16 divides 15232 (15232 ÷ 16 = 952) → pair (16, 952)
  8. 17 divides 15232 (15232 ÷ 17 = 896) → pair (17, 896)
  9. 28 divides 15232 (15232 ÷ 28 = 544) → pair (28, 544)
  10. 32 divides 15232 (15232 ÷ 32 = 476) → pair (32, 476)
  11. 34 divides 15232 (15232 ÷ 34 = 448) → pair (34, 448)
  12. 56 divides 15232 (15232 ÷ 56 = 272) → pair (56, 272)
  13. 64 divides 15232 (15232 ÷ 64 = 238) → pair (64, 238)
  14. 68 divides 15232 (15232 ÷ 68 = 224) → pair (68, 224)
  15. 112 divides 15232 (15232 ÷ 112 = 136) → pair (112, 136)
  16. 119 divides 15232 (15232 ÷ 119 = 128) → pair (119, 128)
  17. Collect all unique values: {1, 2, 4, 7, 8, 14, 16, 17, 28, 32, 34, 56, 64, 68, 112, 119, 128, 136, 224, 238, 272, 448, 476, 544, 896, 952, 1088, 1904, 2176, 3808, 7616, 15232} — total 32 divisors.
  18. Sum: 1 + 2 + 4 + 7 + 8 + 14 + 16 + 17 + 28 + 32 + 34 + 56 + 64 + 68 + 112 + 119 + 128 + 136 + 224 + 238 + 272 + 448 + 476 + 544 + 896 + 952 + 1088 + 1904 + 2176 + 3808 + 7616 + 15232 = 36720.

Nearby Examples

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

Related Operations for 15232

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