Divisors of 65408: All 32 Factors

Quick Answer

65408 has 32 divisors (factors): 1, 2, 4, 7, 8, 14, 16, 28, 32, 56, 64, 73, 112, 128, 146, 224, 292, 448, 511, 584, 896, 1022, 1168, 2044, 2336, 4088, 4672, 8176, 9344, 16352, 32704, 65408.

Sum: 150960.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 4, 7, 8, 14, 16, 28, 32, 56, 64, 73, 112, 128, 146, 224, 292, 448, 511, 584, 896, 1022, 1168, 2044, 2336, 4088, 4672, 8176, 9344, 16352, 32704, 65408

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 65408

The number 65408 has 32 divisors:

1,  2,  4,  7,  8,  14,  16,  28,  32,  56,  64,  73,  112,  128,  146,  224,  292,  448,  511,  584,  896,  1022,  1168,  2044,  2336,  4088,  4672,  8176,  9344,  16352,  32704,  65408

Divisor Pairs of 65408

Each pair multiplies to 65408:

Factor 1×Factor 2=Product
1×65408=65408
2×32704=65408
4×16352=65408
7×9344=65408
8×8176=65408
14×4672=65408
16×4088=65408
28×2336=65408
32×2044=65408
56×1168=65408
64×1022=65408
73×896=65408
112×584=65408
128×511=65408
146×448=65408
224×292=65408

Number of Divisors

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

Sum of Divisors

σ(65408) = 1 + 2 + 4 + 7 + 8 + 14 + 16 + 28 + 32 + 56 + 64 + 73 + 112 + 128 + 146 + 224 + 292 + 448 + 511 + 584 + 896 + 1022 + 1168 + 2044 + 2336 + 4088 + 4672 + 8176 + 9344 + 16352 + 32704 + 65408 = 150960

Properties of 65408

  • 65408 is composite.
  • 65408 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 150960.

Common Divisors with Another Number?

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

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

  1. 1 divides 65408 (65408 ÷ 1 = 65408) → pair (1, 65408)
  2. 2 divides 65408 (65408 ÷ 2 = 32704) → pair (2, 32704)
  3. 4 divides 65408 (65408 ÷ 4 = 16352) → pair (4, 16352)
  4. 7 divides 65408 (65408 ÷ 7 = 9344) → pair (7, 9344)
  5. 8 divides 65408 (65408 ÷ 8 = 8176) → pair (8, 8176)
  6. 14 divides 65408 (65408 ÷ 14 = 4672) → pair (14, 4672)
  7. 16 divides 65408 (65408 ÷ 16 = 4088) → pair (16, 4088)
  8. 28 divides 65408 (65408 ÷ 28 = 2336) → pair (28, 2336)
  9. 32 divides 65408 (65408 ÷ 32 = 2044) → pair (32, 2044)
  10. 56 divides 65408 (65408 ÷ 56 = 1168) → pair (56, 1168)
  11. 64 divides 65408 (65408 ÷ 64 = 1022) → pair (64, 1022)
  12. 73 divides 65408 (65408 ÷ 73 = 896) → pair (73, 896)
  13. 112 divides 65408 (65408 ÷ 112 = 584) → pair (112, 584)
  14. 128 divides 65408 (65408 ÷ 128 = 511) → pair (128, 511)
  15. 146 divides 65408 (65408 ÷ 146 = 448) → pair (146, 448)
  16. 224 divides 65408 (65408 ÷ 224 = 292) → pair (224, 292)
  17. Collect all unique values: {1, 2, 4, 7, 8, 14, 16, 28, 32, 56, 64, 73, 112, 128, 146, 224, 292, 448, 511, 584, 896, 1022, 1168, 2044, 2336, 4088, 4672, 8176, 9344, 16352, 32704, 65408} — total 32 divisors.
  18. Sum: 1 + 2 + 4 + 7 + 8 + 14 + 16 + 28 + 32 + 56 + 64 + 73 + 112 + 128 + 146 + 224 + 292 + 448 + 511 + 584 + 896 + 1022 + 1168 + 2044 + 2336 + 4088 + 4672 + 8176 + 9344 + 16352 + 32704 + 65408 = 150960.

Nearby Examples

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

Related Operations for 65408

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