Divisors of 48800: All 36 Factors

Quick Answer

48800 has 36 divisors (factors): 1, 2, 4, 5, 8, 10, 16, 20, 25, 32, 40, 50, 61, 80, 100, 122, 160, 200, 244, 305, 400, 488, 610, 800, 976, 1220, 1525, 1952, 2440, 3050, 4880, 6100, 9760, 12200, 24400, 48800.

Sum: 121086.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 4, 5, 8, 10, 16, 20, 25, 32, 40, 50, 61, 80, 100, 122, 160, 200, 244, 305, 400, 488, 610, 800, 976, 1220, 1525, 1952, 2440, 3050, 4880, 6100, 9760, 12200, 24400, 48800

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 48800

The number 48800 has 36 divisors:

1,  2,  4,  5,  8,  10,  16,  20,  25,  32,  40,  50,  61,  80,  100,  122,  160,  200,  244,  305,  400,  488,  610,  800,  976,  1220,  1525,  1952,  2440,  3050,  4880,  6100,  9760,  12200,  24400,  48800

Divisor Pairs of 48800

Each pair multiplies to 48800:

Factor 1×Factor 2=Product
1×48800=48800
2×24400=48800
4×12200=48800
5×9760=48800
8×6100=48800
10×4880=48800
16×3050=48800
20×2440=48800
25×1952=48800
32×1525=48800
40×1220=48800
50×976=48800
61×800=48800
80×610=48800
100×488=48800
122×400=48800
160×305=48800
200×244=48800

Number of Divisors

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

Sum of Divisors

σ(48800) = 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 25 + 32 + 40 + 50 + 61 + 80 + 100 + 122 + 160 + 200 + 244 + 305 + 400 + 488 + 610 + 800 + 976 + 1220 + 1525 + 1952 + 2440 + 3050 + 4880 + 6100 + 9760 + 12200 + 24400 + 48800 = 121086

Properties of 48800

  • 48800 is composite.
  • 48800 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 121086.

Common Divisors with Another Number?

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

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

  1. 1 divides 48800 (48800 ÷ 1 = 48800) → pair (1, 48800)
  2. 2 divides 48800 (48800 ÷ 2 = 24400) → pair (2, 24400)
  3. 4 divides 48800 (48800 ÷ 4 = 12200) → pair (4, 12200)
  4. 5 divides 48800 (48800 ÷ 5 = 9760) → pair (5, 9760)
  5. 8 divides 48800 (48800 ÷ 8 = 6100) → pair (8, 6100)
  6. 10 divides 48800 (48800 ÷ 10 = 4880) → pair (10, 4880)
  7. 16 divides 48800 (48800 ÷ 16 = 3050) → pair (16, 3050)
  8. 20 divides 48800 (48800 ÷ 20 = 2440) → pair (20, 2440)
  9. 25 divides 48800 (48800 ÷ 25 = 1952) → pair (25, 1952)
  10. 32 divides 48800 (48800 ÷ 32 = 1525) → pair (32, 1525)
  11. 40 divides 48800 (48800 ÷ 40 = 1220) → pair (40, 1220)
  12. 50 divides 48800 (48800 ÷ 50 = 976) → pair (50, 976)
  13. 61 divides 48800 (48800 ÷ 61 = 800) → pair (61, 800)
  14. 80 divides 48800 (48800 ÷ 80 = 610) → pair (80, 610)
  15. 100 divides 48800 (48800 ÷ 100 = 488) → pair (100, 488)
  16. 122 divides 48800 (48800 ÷ 122 = 400) → pair (122, 400)
  17. 160 divides 48800 (48800 ÷ 160 = 305) → pair (160, 305)
  18. 200 divides 48800 (48800 ÷ 200 = 244) → pair (200, 244)
  19. Collect all unique values: {1, 2, 4, 5, 8, 10, 16, 20, 25, 32, 40, 50, 61, 80, 100, 122, 160, 200, 244, 305, 400, 488, 610, 800, 976, 1220, 1525, 1952, 2440, 3050, 4880, 6100, 9760, 12200, 24400, 48800} — total 36 divisors.
  20. Sum: 1 + 2 + 4 + 5 + 8 + 10 + 16 + 20 + 25 + 32 + 40 + 50 + 61 + 80 + 100 + 122 + 160 + 200 + 244 + 305 + 400 + 488 + 610 + 800 + 976 + 1220 + 1525 + 1952 + 2440 + 3050 + 4880 + 6100 + 9760 + 12200 + 24400 + 48800 = 121086.

Nearby Examples

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

Related Operations for 48800

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