Divisors of 49152: All 30 Factors

Quick Answer

49152 has 30 divisors (factors): 1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 128, 192, 256, 384, 512, 768, 1024, 1536, 2048, 3072, 4096, 6144, 8192, 12288, 16384, 24576, 49152.

Sum: 131068.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
30 divisors
1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 128, 192, 256, 384, 512, 768, 1024, 1536, 2048, 3072, 4096, 6144, 8192, 12288, 16384, 24576, 49152

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 49152

The number 49152 has 30 divisors:

1,  2,  3,  4,  6,  8,  12,  16,  24,  32,  48,  64,  96,  128,  192,  256,  384,  512,  768,  1024,  1536,  2048,  3072,  4096,  6144,  8192,  12288,  16384,  24576,  49152

Divisor Pairs of 49152

Each pair multiplies to 49152:

Factor 1×Factor 2=Product
1×49152=49152
2×24576=49152
3×16384=49152
4×12288=49152
6×8192=49152
8×6144=49152
12×4096=49152
16×3072=49152
24×2048=49152
32×1536=49152
48×1024=49152
64×768=49152
96×512=49152
128×384=49152
192×256=49152

Number of Divisors

The number 49152 has 30 divisors, written as τ(49152) = 30 in number theory.

Sum of Divisors

σ(49152) = 1 + 2 + 3 + 4 + 6 + 8 + 12 + 16 + 24 + 32 + 48 + 64 + 96 + 128 + 192 + 256 + 384 + 512 + 768 + 1024 + 1536 + 2048 + 3072 + 4096 + 6144 + 8192 + 12288 + 16384 + 24576 + 49152 = 131068

Properties of 49152

  • 49152 is composite.
  • 49152 is not a perfect square.
  • Number of divisors: 30.
  • Sum of divisors: 131068.

Common Divisors with Another Number?

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

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

  1. 1 divides 49152 (49152 ÷ 1 = 49152) → pair (1, 49152)
  2. 2 divides 49152 (49152 ÷ 2 = 24576) → pair (2, 24576)
  3. 3 divides 49152 (49152 ÷ 3 = 16384) → pair (3, 16384)
  4. 4 divides 49152 (49152 ÷ 4 = 12288) → pair (4, 12288)
  5. 6 divides 49152 (49152 ÷ 6 = 8192) → pair (6, 8192)
  6. 8 divides 49152 (49152 ÷ 8 = 6144) → pair (8, 6144)
  7. 12 divides 49152 (49152 ÷ 12 = 4096) → pair (12, 4096)
  8. 16 divides 49152 (49152 ÷ 16 = 3072) → pair (16, 3072)
  9. 24 divides 49152 (49152 ÷ 24 = 2048) → pair (24, 2048)
  10. 32 divides 49152 (49152 ÷ 32 = 1536) → pair (32, 1536)
  11. 48 divides 49152 (49152 ÷ 48 = 1024) → pair (48, 1024)
  12. 64 divides 49152 (49152 ÷ 64 = 768) → pair (64, 768)
  13. 96 divides 49152 (49152 ÷ 96 = 512) → pair (96, 512)
  14. 128 divides 49152 (49152 ÷ 128 = 384) → pair (128, 384)
  15. 192 divides 49152 (49152 ÷ 192 = 256) → pair (192, 256)
  16. Collect all unique values: {1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 128, 192, 256, 384, 512, 768, 1024, 1536, 2048, 3072, 4096, 6144, 8192, 12288, 16384, 24576, 49152} — total 30 divisors.
  17. Sum: 1 + 2 + 3 + 4 + 6 + 8 + 12 + 16 + 24 + 32 + 48 + 64 + 96 + 128 + 192 + 256 + 384 + 512 + 768 + 1024 + 1536 + 2048 + 3072 + 4096 + 6144 + 8192 + 12288 + 16384 + 24576 + 49152 = 131068.

Nearby Examples

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

Related Operations for 49152

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