Divisors of 59248: All 30 Factors

Quick Answer

59248 has 30 divisors (factors): 1, 2, 4, 7, 8, 14, 16, 23, 28, 46, 56, 92, 112, 161, 184, 322, 368, 529, 644, 1058, 1288, 2116, 2576, 3703, 4232, 7406, 8464, 14812, 29624, 59248.

Sum: 137144.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
30 divisors
1, 2, 4, 7, 8, 14, 16, 23, 28, 46, 56, 92, 112, 161, 184, 322, 368, 529, 644, 1058, 1288, 2116, 2576, 3703, 4232, 7406, 8464, 14812, 29624, 59248

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 59248

The number 59248 has 30 divisors:

1,  2,  4,  7,  8,  14,  16,  23,  28,  46,  56,  92,  112,  161,  184,  322,  368,  529,  644,  1058,  1288,  2116,  2576,  3703,  4232,  7406,  8464,  14812,  29624,  59248

Divisor Pairs of 59248

Each pair multiplies to 59248:

Factor 1×Factor 2=Product
1×59248=59248
2×29624=59248
4×14812=59248
7×8464=59248
8×7406=59248
14×4232=59248
16×3703=59248
23×2576=59248
28×2116=59248
46×1288=59248
56×1058=59248
92×644=59248
112×529=59248
161×368=59248
184×322=59248

Number of Divisors

The number 59248 has 30 divisors, written as τ(59248) = 30 in number theory.

Sum of Divisors

σ(59248) = 1 + 2 + 4 + 7 + 8 + 14 + 16 + 23 + 28 + 46 + 56 + 92 + 112 + 161 + 184 + 322 + 368 + 529 + 644 + 1058 + 1288 + 2116 + 2576 + 3703 + 4232 + 7406 + 8464 + 14812 + 29624 + 59248 = 137144

Properties of 59248

  • 59248 is composite.
  • 59248 is not a perfect square.
  • Number of divisors: 30.
  • Sum of divisors: 137144.

Common Divisors with Another Number?

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

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

  1. 1 divides 59248 (59248 ÷ 1 = 59248) → pair (1, 59248)
  2. 2 divides 59248 (59248 ÷ 2 = 29624) → pair (2, 29624)
  3. 4 divides 59248 (59248 ÷ 4 = 14812) → pair (4, 14812)
  4. 7 divides 59248 (59248 ÷ 7 = 8464) → pair (7, 8464)
  5. 8 divides 59248 (59248 ÷ 8 = 7406) → pair (8, 7406)
  6. 14 divides 59248 (59248 ÷ 14 = 4232) → pair (14, 4232)
  7. 16 divides 59248 (59248 ÷ 16 = 3703) → pair (16, 3703)
  8. 23 divides 59248 (59248 ÷ 23 = 2576) → pair (23, 2576)
  9. 28 divides 59248 (59248 ÷ 28 = 2116) → pair (28, 2116)
  10. 46 divides 59248 (59248 ÷ 46 = 1288) → pair (46, 1288)
  11. 56 divides 59248 (59248 ÷ 56 = 1058) → pair (56, 1058)
  12. 92 divides 59248 (59248 ÷ 92 = 644) → pair (92, 644)
  13. 112 divides 59248 (59248 ÷ 112 = 529) → pair (112, 529)
  14. 161 divides 59248 (59248 ÷ 161 = 368) → pair (161, 368)
  15. 184 divides 59248 (59248 ÷ 184 = 322) → pair (184, 322)
  16. Collect all unique values: {1, 2, 4, 7, 8, 14, 16, 23, 28, 46, 56, 92, 112, 161, 184, 322, 368, 529, 644, 1058, 1288, 2116, 2576, 3703, 4232, 7406, 8464, 14812, 29624, 59248} — total 30 divisors.
  17. Sum: 1 + 2 + 4 + 7 + 8 + 14 + 16 + 23 + 28 + 46 + 56 + 92 + 112 + 161 + 184 + 322 + 368 + 529 + 644 + 1058 + 1288 + 2116 + 2576 + 3703 + 4232 + 7406 + 8464 + 14812 + 29624 + 59248 = 137144.

Nearby Examples

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

Related Operations for 59248

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