Divisors of 51456: All 36 Factors

Quick Answer

51456 has 36 divisors (factors): 1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 67, 96, 128, 134, 192, 201, 256, 268, 384, 402, 536, 768, 804, 1072, 1608, 2144, 3216, 4288, 6432, 8576, 12864, 17152, 25728, 51456.

Sum: 138992.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 67, 96, 128, 134, 192, 201, 256, 268, 384, 402, 536, 768, 804, 1072, 1608, 2144, 3216, 4288, 6432, 8576, 12864, 17152, 25728, 51456

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 51456

The number 51456 has 36 divisors:

1,  2,  3,  4,  6,  8,  12,  16,  24,  32,  48,  64,  67,  96,  128,  134,  192,  201,  256,  268,  384,  402,  536,  768,  804,  1072,  1608,  2144,  3216,  4288,  6432,  8576,  12864,  17152,  25728,  51456

Divisor Pairs of 51456

Each pair multiplies to 51456:

Factor 1×Factor 2=Product
1×51456=51456
2×25728=51456
3×17152=51456
4×12864=51456
6×8576=51456
8×6432=51456
12×4288=51456
16×3216=51456
24×2144=51456
32×1608=51456
48×1072=51456
64×804=51456
67×768=51456
96×536=51456
128×402=51456
134×384=51456
192×268=51456
201×256=51456

Number of Divisors

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

Sum of Divisors

σ(51456) = 1 + 2 + 3 + 4 + 6 + 8 + 12 + 16 + 24 + 32 + 48 + 64 + 67 + 96 + 128 + 134 + 192 + 201 + 256 + 268 + 384 + 402 + 536 + 768 + 804 + 1072 + 1608 + 2144 + 3216 + 4288 + 6432 + 8576 + 12864 + 17152 + 25728 + 51456 = 138992

Properties of 51456

  • 51456 is composite.
  • 51456 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 138992.

Common Divisors with Another Number?

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

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

  1. 1 divides 51456 (51456 ÷ 1 = 51456) → pair (1, 51456)
  2. 2 divides 51456 (51456 ÷ 2 = 25728) → pair (2, 25728)
  3. 3 divides 51456 (51456 ÷ 3 = 17152) → pair (3, 17152)
  4. 4 divides 51456 (51456 ÷ 4 = 12864) → pair (4, 12864)
  5. 6 divides 51456 (51456 ÷ 6 = 8576) → pair (6, 8576)
  6. 8 divides 51456 (51456 ÷ 8 = 6432) → pair (8, 6432)
  7. 12 divides 51456 (51456 ÷ 12 = 4288) → pair (12, 4288)
  8. 16 divides 51456 (51456 ÷ 16 = 3216) → pair (16, 3216)
  9. 24 divides 51456 (51456 ÷ 24 = 2144) → pair (24, 2144)
  10. 32 divides 51456 (51456 ÷ 32 = 1608) → pair (32, 1608)
  11. 48 divides 51456 (51456 ÷ 48 = 1072) → pair (48, 1072)
  12. 64 divides 51456 (51456 ÷ 64 = 804) → pair (64, 804)
  13. 67 divides 51456 (51456 ÷ 67 = 768) → pair (67, 768)
  14. 96 divides 51456 (51456 ÷ 96 = 536) → pair (96, 536)
  15. 128 divides 51456 (51456 ÷ 128 = 402) → pair (128, 402)
  16. 134 divides 51456 (51456 ÷ 134 = 384) → pair (134, 384)
  17. 192 divides 51456 (51456 ÷ 192 = 268) → pair (192, 268)
  18. 201 divides 51456 (51456 ÷ 201 = 256) → pair (201, 256)
  19. Collect all unique values: {1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 67, 96, 128, 134, 192, 201, 256, 268, 384, 402, 536, 768, 804, 1072, 1608, 2144, 3216, 4288, 6432, 8576, 12864, 17152, 25728, 51456} — total 36 divisors.
  20. Sum: 1 + 2 + 3 + 4 + 6 + 8 + 12 + 16 + 24 + 32 + 48 + 64 + 67 + 96 + 128 + 134 + 192 + 201 + 256 + 268 + 384 + 402 + 536 + 768 + 804 + 1072 + 1608 + 2144 + 3216 + 4288 + 6432 + 8576 + 12864 + 17152 + 25728 + 51456 = 138992.

Nearby Examples

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

Related Operations for 51456

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