Divisors of 43960: All 32 Factors

Quick Answer

43960 has 32 divisors (factors): 1, 2, 4, 5, 7, 8, 10, 14, 20, 28, 35, 40, 56, 70, 140, 157, 280, 314, 628, 785, 1099, 1256, 1570, 2198, 3140, 4396, 5495, 6280, 8792, 10990, 21980, 43960.

Sum: 113760.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 4, 5, 7, 8, 10, 14, 20, 28, 35, 40, 56, 70, 140, 157, 280, 314, 628, 785, 1099, 1256, 1570, 2198, 3140, 4396, 5495, 6280, 8792, 10990, 21980, 43960

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 43960

The number 43960 has 32 divisors:

1,  2,  4,  5,  7,  8,  10,  14,  20,  28,  35,  40,  56,  70,  140,  157,  280,  314,  628,  785,  1099,  1256,  1570,  2198,  3140,  4396,  5495,  6280,  8792,  10990,  21980,  43960

Divisor Pairs of 43960

Each pair multiplies to 43960:

Factor 1×Factor 2=Product
1×43960=43960
2×21980=43960
4×10990=43960
5×8792=43960
7×6280=43960
8×5495=43960
10×4396=43960
14×3140=43960
20×2198=43960
28×1570=43960
35×1256=43960
40×1099=43960
56×785=43960
70×628=43960
140×314=43960
157×280=43960

Number of Divisors

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

Sum of Divisors

σ(43960) = 1 + 2 + 4 + 5 + 7 + 8 + 10 + 14 + 20 + 28 + 35 + 40 + 56 + 70 + 140 + 157 + 280 + 314 + 628 + 785 + 1099 + 1256 + 1570 + 2198 + 3140 + 4396 + 5495 + 6280 + 8792 + 10990 + 21980 + 43960 = 113760

Properties of 43960

  • 43960 is composite.
  • 43960 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 113760.

Common Divisors with Another Number?

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

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

  1. 1 divides 43960 (43960 ÷ 1 = 43960) → pair (1, 43960)
  2. 2 divides 43960 (43960 ÷ 2 = 21980) → pair (2, 21980)
  3. 4 divides 43960 (43960 ÷ 4 = 10990) → pair (4, 10990)
  4. 5 divides 43960 (43960 ÷ 5 = 8792) → pair (5, 8792)
  5. 7 divides 43960 (43960 ÷ 7 = 6280) → pair (7, 6280)
  6. 8 divides 43960 (43960 ÷ 8 = 5495) → pair (8, 5495)
  7. 10 divides 43960 (43960 ÷ 10 = 4396) → pair (10, 4396)
  8. 14 divides 43960 (43960 ÷ 14 = 3140) → pair (14, 3140)
  9. 20 divides 43960 (43960 ÷ 20 = 2198) → pair (20, 2198)
  10. 28 divides 43960 (43960 ÷ 28 = 1570) → pair (28, 1570)
  11. 35 divides 43960 (43960 ÷ 35 = 1256) → pair (35, 1256)
  12. 40 divides 43960 (43960 ÷ 40 = 1099) → pair (40, 1099)
  13. 56 divides 43960 (43960 ÷ 56 = 785) → pair (56, 785)
  14. 70 divides 43960 (43960 ÷ 70 = 628) → pair (70, 628)
  15. 140 divides 43960 (43960 ÷ 140 = 314) → pair (140, 314)
  16. 157 divides 43960 (43960 ÷ 157 = 280) → pair (157, 280)
  17. Collect all unique values: {1, 2, 4, 5, 7, 8, 10, 14, 20, 28, 35, 40, 56, 70, 140, 157, 280, 314, 628, 785, 1099, 1256, 1570, 2198, 3140, 4396, 5495, 6280, 8792, 10990, 21980, 43960} — total 32 divisors.
  18. Sum: 1 + 2 + 4 + 5 + 7 + 8 + 10 + 14 + 20 + 28 + 35 + 40 + 56 + 70 + 140 + 157 + 280 + 314 + 628 + 785 + 1099 + 1256 + 1570 + 2198 + 3140 + 4396 + 5495 + 6280 + 8792 + 10990 + 21980 + 43960 = 113760.

Nearby Examples

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

Related Operations for 43960

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