Divisors of 15264: All 36 Factors

Quick Answer

15264 has 36 divisors (factors): 1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 32, 36, 48, 53, 72, 96, 106, 144, 159, 212, 288, 318, 424, 477, 636, 848, 954, 1272, 1696, 1908, 2544, 3816, 5088, 7632, 15264.

Sum: 44226.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 32, 36, 48, 53, 72, 96, 106, 144, 159, 212, 288, 318, 424, 477, 636, 848, 954, 1272, 1696, 1908, 2544, 3816, 5088, 7632, 15264

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 15264

The number 15264 has 36 divisors:

1,  2,  3,  4,  6,  8,  9,  12,  16,  18,  24,  32,  36,  48,  53,  72,  96,  106,  144,  159,  212,  288,  318,  424,  477,  636,  848,  954,  1272,  1696,  1908,  2544,  3816,  5088,  7632,  15264

Divisor Pairs of 15264

Each pair multiplies to 15264:

Factor 1×Factor 2=Product
1×15264=15264
2×7632=15264
3×5088=15264
4×3816=15264
6×2544=15264
8×1908=15264
9×1696=15264
12×1272=15264
16×954=15264
18×848=15264
24×636=15264
32×477=15264
36×424=15264
48×318=15264
53×288=15264
72×212=15264
96×159=15264
106×144=15264

Number of Divisors

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

Sum of Divisors

σ(15264) = 1 + 2 + 3 + 4 + 6 + 8 + 9 + 12 + 16 + 18 + 24 + 32 + 36 + 48 + 53 + 72 + 96 + 106 + 144 + 159 + 212 + 288 + 318 + 424 + 477 + 636 + 848 + 954 + 1272 + 1696 + 1908 + 2544 + 3816 + 5088 + 7632 + 15264 = 44226

Properties of 15264

  • 15264 is composite.
  • 15264 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 44226.

Common Divisors with Another Number?

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

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

  1. 1 divides 15264 (15264 ÷ 1 = 15264) → pair (1, 15264)
  2. 2 divides 15264 (15264 ÷ 2 = 7632) → pair (2, 7632)
  3. 3 divides 15264 (15264 ÷ 3 = 5088) → pair (3, 5088)
  4. 4 divides 15264 (15264 ÷ 4 = 3816) → pair (4, 3816)
  5. 6 divides 15264 (15264 ÷ 6 = 2544) → pair (6, 2544)
  6. 8 divides 15264 (15264 ÷ 8 = 1908) → pair (8, 1908)
  7. 9 divides 15264 (15264 ÷ 9 = 1696) → pair (9, 1696)
  8. 12 divides 15264 (15264 ÷ 12 = 1272) → pair (12, 1272)
  9. 16 divides 15264 (15264 ÷ 16 = 954) → pair (16, 954)
  10. 18 divides 15264 (15264 ÷ 18 = 848) → pair (18, 848)
  11. 24 divides 15264 (15264 ÷ 24 = 636) → pair (24, 636)
  12. 32 divides 15264 (15264 ÷ 32 = 477) → pair (32, 477)
  13. 36 divides 15264 (15264 ÷ 36 = 424) → pair (36, 424)
  14. 48 divides 15264 (15264 ÷ 48 = 318) → pair (48, 318)
  15. 53 divides 15264 (15264 ÷ 53 = 288) → pair (53, 288)
  16. 72 divides 15264 (15264 ÷ 72 = 212) → pair (72, 212)
  17. 96 divides 15264 (15264 ÷ 96 = 159) → pair (96, 159)
  18. 106 divides 15264 (15264 ÷ 106 = 144) → pair (106, 144)
  19. Collect all unique values: {1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 32, 36, 48, 53, 72, 96, 106, 144, 159, 212, 288, 318, 424, 477, 636, 848, 954, 1272, 1696, 1908, 2544, 3816, 5088, 7632, 15264} — total 36 divisors.
  20. Sum: 1 + 2 + 3 + 4 + 6 + 8 + 9 + 12 + 16 + 18 + 24 + 32 + 36 + 48 + 53 + 72 + 96 + 106 + 144 + 159 + 212 + 288 + 318 + 424 + 477 + 636 + 848 + 954 + 1272 + 1696 + 1908 + 2544 + 3816 + 5088 + 7632 + 15264 = 44226.

Nearby Examples

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

Related Operations for 15264

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