Divisors of 30976: All 27 Factors

Quick Answer

30976 has 27 divisors (factors): 1, 2, 4, 8, 11, 16, 22, 32, 44, 64, 88, 121, 128, 176, 242, 256, 352, 484, 704, 968, 1408, 1936, 2816, 3872, 7744, 15488, 30976.

Sum: 67963.  30976 is a perfect square (√30976 = 176).

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
27 divisors
1, 2, 4, 8, 11, 16, 22, 32, 44, 64, 88, 121, 128, 176, 242, 256, 352, 484, 704, 968, 1408, 1936, 2816, 3872, 7744, 15488, 30976

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 30976

The number 30976 has 27 divisors:

1,  2,  4,  8,  11,  16,  22,  32,  44,  64,  88,  121,  128,  176,  242,  256,  352,  484,  704,  968,  1408,  1936,  2816,  3872,  7744,  15488,  30976

Divisor Pairs of 30976

Each pair multiplies to 30976:

Factor 1×Factor 2=Product
1×30976=30976
2×15488=30976
4×7744=30976
8×3872=30976
11×2816=30976
16×1936=30976
22×1408=30976
32×968=30976
44×704=30976
64×484=30976
88×352=30976
121×256=30976
128×242=30976
176×176=30976

Note: the last pair has identical factors (176 × 176) because 30976 is a perfect square.

Number of Divisors

The number 30976 has 27 divisors, written as τ(30976) = 27 in number theory.

Notice: 30976 has an odd number of divisors — this means 30976 is a perfect square (√30976 = 176).

Sum of Divisors

σ(30976) = 1 + 2 + 4 + 8 + 11 + 16 + 22 + 32 + 44 + 64 + 88 + 121 + 128 + 176 + 242 + 256 + 352 + 484 + 704 + 968 + 1408 + 1936 + 2816 + 3872 + 7744 + 15488 + 30976 = 67963

Properties of 30976

  • 30976 is composite.
  • 30976 is a perfect square (√30976 = 176).
  • Number of divisors: 27.
  • Sum of divisors: 67963.

Common Divisors with Another Number?

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

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

  1. 1 divides 30976 (30976 ÷ 1 = 30976) → pair (1, 30976)
  2. 2 divides 30976 (30976 ÷ 2 = 15488) → pair (2, 15488)
  3. 4 divides 30976 (30976 ÷ 4 = 7744) → pair (4, 7744)
  4. 8 divides 30976 (30976 ÷ 8 = 3872) → pair (8, 3872)
  5. 11 divides 30976 (30976 ÷ 11 = 2816) → pair (11, 2816)
  6. 16 divides 30976 (30976 ÷ 16 = 1936) → pair (16, 1936)
  7. 22 divides 30976 (30976 ÷ 22 = 1408) → pair (22, 1408)
  8. 32 divides 30976 (30976 ÷ 32 = 968) → pair (32, 968)
  9. 44 divides 30976 (30976 ÷ 44 = 704) → pair (44, 704)
  10. 64 divides 30976 (30976 ÷ 64 = 484) → pair (64, 484)
  11. 88 divides 30976 (30976 ÷ 88 = 352) → pair (88, 352)
  12. 121 divides 30976 (30976 ÷ 121 = 256) → pair (121, 256)
  13. 128 divides 30976 (30976 ÷ 128 = 242) → pair (128, 242)
  14. 176 divides 30976 (30976 ÷ 176 = 176) → pair (176, 176)
  15. Collect all unique values: {1, 2, 4, 8, 11, 16, 22, 32, 44, 64, 88, 121, 128, 176, 242, 256, 352, 484, 704, 968, 1408, 1936, 2816, 3872, 7744, 15488, 30976} — total 27 divisors.
  16. Sum: 1 + 2 + 4 + 8 + 11 + 16 + 22 + 32 + 44 + 64 + 88 + 121 + 128 + 176 + 242 + 256 + 352 + 484 + 704 + 968 + 1408 + 1936 + 2816 + 3872 + 7744 + 15488 + 30976 = 67963.

Nearby Examples

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

Related Operations for 30976

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