Divisors of 8960: All 36 Factors

Quick Answer

8960 has 36 divisors (factors): 1, 2, 4, 5, 7, 8, 10, 14, 16, 20, 28, 32, 35, 40, 56, 64, 70, 80, 112, 128, 140, 160, 224, 256, 280, 320, 448, 560, 640, 896, 1120, 1280, 1792, 2240, 4480, 8960.

Sum: 24528.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 4, 5, 7, 8, 10, 14, 16, 20, 28, 32, 35, 40, 56, 64, 70, 80, 112, 128, 140, 160, 224, 256, 280, 320, 448, 560, 640, 896, 1120, 1280, 1792, 2240, 4480, 8960

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 8960

The number 8960 has 36 divisors:

1,  2,  4,  5,  7,  8,  10,  14,  16,  20,  28,  32,  35,  40,  56,  64,  70,  80,  112,  128,  140,  160,  224,  256,  280,  320,  448,  560,  640,  896,  1120,  1280,  1792,  2240,  4480,  8960

Divisor Pairs of 8960

Each pair multiplies to 8960:

Factor 1×Factor 2=Product
1×8960=8960
2×4480=8960
4×2240=8960
5×1792=8960
7×1280=8960
8×1120=8960
10×896=8960
14×640=8960
16×560=8960
20×448=8960
28×320=8960
32×280=8960
35×256=8960
40×224=8960
56×160=8960
64×140=8960
70×128=8960
80×112=8960

Number of Divisors

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

Sum of Divisors

σ(8960) = 1 + 2 + 4 + 5 + 7 + 8 + 10 + 14 + 16 + 20 + 28 + 32 + 35 + 40 + 56 + 64 + 70 + 80 + 112 + 128 + 140 + 160 + 224 + 256 + 280 + 320 + 448 + 560 + 640 + 896 + 1120 + 1280 + 1792 + 2240 + 4480 + 8960 = 24528

Properties of 8960

  • 8960 is composite.
  • 8960 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 24528.

Common Divisors with Another Number?

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

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

  1. 1 divides 8960 (8960 ÷ 1 = 8960) → pair (1, 8960)
  2. 2 divides 8960 (8960 ÷ 2 = 4480) → pair (2, 4480)
  3. 4 divides 8960 (8960 ÷ 4 = 2240) → pair (4, 2240)
  4. 5 divides 8960 (8960 ÷ 5 = 1792) → pair (5, 1792)
  5. 7 divides 8960 (8960 ÷ 7 = 1280) → pair (7, 1280)
  6. 8 divides 8960 (8960 ÷ 8 = 1120) → pair (8, 1120)
  7. 10 divides 8960 (8960 ÷ 10 = 896) → pair (10, 896)
  8. 14 divides 8960 (8960 ÷ 14 = 640) → pair (14, 640)
  9. 16 divides 8960 (8960 ÷ 16 = 560) → pair (16, 560)
  10. 20 divides 8960 (8960 ÷ 20 = 448) → pair (20, 448)
  11. 28 divides 8960 (8960 ÷ 28 = 320) → pair (28, 320)
  12. 32 divides 8960 (8960 ÷ 32 = 280) → pair (32, 280)
  13. 35 divides 8960 (8960 ÷ 35 = 256) → pair (35, 256)
  14. 40 divides 8960 (8960 ÷ 40 = 224) → pair (40, 224)
  15. 56 divides 8960 (8960 ÷ 56 = 160) → pair (56, 160)
  16. 64 divides 8960 (8960 ÷ 64 = 140) → pair (64, 140)
  17. 70 divides 8960 (8960 ÷ 70 = 128) → pair (70, 128)
  18. 80 divides 8960 (8960 ÷ 80 = 112) → pair (80, 112)
  19. Collect all unique values: {1, 2, 4, 5, 7, 8, 10, 14, 16, 20, 28, 32, 35, 40, 56, 64, 70, 80, 112, 128, 140, 160, 224, 256, 280, 320, 448, 560, 640, 896, 1120, 1280, 1792, 2240, 4480, 8960} — total 36 divisors.
  20. Sum: 1 + 2 + 4 + 5 + 7 + 8 + 10 + 14 + 16 + 20 + 28 + 32 + 35 + 40 + 56 + 64 + 70 + 80 + 112 + 128 + 140 + 160 + 224 + 256 + 280 + 320 + 448 + 560 + 640 + 896 + 1120 + 1280 + 1792 + 2240 + 4480 + 8960 = 24528.

Nearby Examples

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

Related Operations for 8960

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