Divisors of 30336: All 32 Factors

Quick Answer

30336 has 32 divisors (factors): 1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 79, 96, 128, 158, 192, 237, 316, 384, 474, 632, 948, 1264, 1896, 2528, 3792, 5056, 7584, 10112, 15168, 30336.

Sum: 81600.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 79, 96, 128, 158, 192, 237, 316, 384, 474, 632, 948, 1264, 1896, 2528, 3792, 5056, 7584, 10112, 15168, 30336

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 30336

The number 30336 has 32 divisors:

1,  2,  3,  4,  6,  8,  12,  16,  24,  32,  48,  64,  79,  96,  128,  158,  192,  237,  316,  384,  474,  632,  948,  1264,  1896,  2528,  3792,  5056,  7584,  10112,  15168,  30336

Divisor Pairs of 30336

Each pair multiplies to 30336:

Factor 1×Factor 2=Product
1×30336=30336
2×15168=30336
3×10112=30336
4×7584=30336
6×5056=30336
8×3792=30336
12×2528=30336
16×1896=30336
24×1264=30336
32×948=30336
48×632=30336
64×474=30336
79×384=30336
96×316=30336
128×237=30336
158×192=30336

Number of Divisors

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

Sum of Divisors

σ(30336) = 1 + 2 + 3 + 4 + 6 + 8 + 12 + 16 + 24 + 32 + 48 + 64 + 79 + 96 + 128 + 158 + 192 + 237 + 316 + 384 + 474 + 632 + 948 + 1264 + 1896 + 2528 + 3792 + 5056 + 7584 + 10112 + 15168 + 30336 = 81600

Properties of 30336

  • 30336 is composite.
  • 30336 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 81600.

Common Divisors with Another Number?

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

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

  1. 1 divides 30336 (30336 ÷ 1 = 30336) → pair (1, 30336)
  2. 2 divides 30336 (30336 ÷ 2 = 15168) → pair (2, 15168)
  3. 3 divides 30336 (30336 ÷ 3 = 10112) → pair (3, 10112)
  4. 4 divides 30336 (30336 ÷ 4 = 7584) → pair (4, 7584)
  5. 6 divides 30336 (30336 ÷ 6 = 5056) → pair (6, 5056)
  6. 8 divides 30336 (30336 ÷ 8 = 3792) → pair (8, 3792)
  7. 12 divides 30336 (30336 ÷ 12 = 2528) → pair (12, 2528)
  8. 16 divides 30336 (30336 ÷ 16 = 1896) → pair (16, 1896)
  9. 24 divides 30336 (30336 ÷ 24 = 1264) → pair (24, 1264)
  10. 32 divides 30336 (30336 ÷ 32 = 948) → pair (32, 948)
  11. 48 divides 30336 (30336 ÷ 48 = 632) → pair (48, 632)
  12. 64 divides 30336 (30336 ÷ 64 = 474) → pair (64, 474)
  13. 79 divides 30336 (30336 ÷ 79 = 384) → pair (79, 384)
  14. 96 divides 30336 (30336 ÷ 96 = 316) → pair (96, 316)
  15. 128 divides 30336 (30336 ÷ 128 = 237) → pair (128, 237)
  16. 158 divides 30336 (30336 ÷ 158 = 192) → pair (158, 192)
  17. Collect all unique values: {1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 79, 96, 128, 158, 192, 237, 316, 384, 474, 632, 948, 1264, 1896, 2528, 3792, 5056, 7584, 10112, 15168, 30336} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 4 + 6 + 8 + 12 + 16 + 24 + 32 + 48 + 64 + 79 + 96 + 128 + 158 + 192 + 237 + 316 + 384 + 474 + 632 + 948 + 1264 + 1896 + 2528 + 3792 + 5056 + 7584 + 10112 + 15168 + 30336 = 81600.

Nearby Examples

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

Related Operations for 30336

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