Divisors of 53361: All 27 Factors

Quick Answer

53361 has 27 divisors (factors): 1, 3, 7, 9, 11, 21, 33, 49, 63, 77, 99, 121, 147, 231, 363, 441, 539, 693, 847, 1089, 1617, 2541, 4851, 5929, 7623, 17787, 53361.

Sum: 98553.  53361 is a perfect square (√53361 = 231).

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
27 divisors
1, 3, 7, 9, 11, 21, 33, 49, 63, 77, 99, 121, 147, 231, 363, 441, 539, 693, 847, 1089, 1617, 2541, 4851, 5929, 7623, 17787, 53361

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 53361

The number 53361 has 27 divisors:

1,  3,  7,  9,  11,  21,  33,  49,  63,  77,  99,  121,  147,  231,  363,  441,  539,  693,  847,  1089,  1617,  2541,  4851,  5929,  7623,  17787,  53361

Divisor Pairs of 53361

Each pair multiplies to 53361:

Factor 1×Factor 2=Product
1×53361=53361
3×17787=53361
7×7623=53361
9×5929=53361
11×4851=53361
21×2541=53361
33×1617=53361
49×1089=53361
63×847=53361
77×693=53361
99×539=53361
121×441=53361
147×363=53361
231×231=53361

Note: the last pair has identical factors (231 × 231) because 53361 is a perfect square.

Number of Divisors

The number 53361 has 27 divisors, written as τ(53361) = 27 in number theory.

Notice: 53361 has an odd number of divisors — this means 53361 is a perfect square (√53361 = 231).

Sum of Divisors

σ(53361) = 1 + 3 + 7 + 9 + 11 + 21 + 33 + 49 + 63 + 77 + 99 + 121 + 147 + 231 + 363 + 441 + 539 + 693 + 847 + 1089 + 1617 + 2541 + 4851 + 5929 + 7623 + 17787 + 53361 = 98553

Properties of 53361

  • 53361 is composite.
  • 53361 is a perfect square (√53361 = 231).
  • Number of divisors: 27.
  • Sum of divisors: 98553.

Common Divisors with Another Number?

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

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

  1. 1 divides 53361 (53361 ÷ 1 = 53361) → pair (1, 53361)
  2. 3 divides 53361 (53361 ÷ 3 = 17787) → pair (3, 17787)
  3. 7 divides 53361 (53361 ÷ 7 = 7623) → pair (7, 7623)
  4. 9 divides 53361 (53361 ÷ 9 = 5929) → pair (9, 5929)
  5. 11 divides 53361 (53361 ÷ 11 = 4851) → pair (11, 4851)
  6. 21 divides 53361 (53361 ÷ 21 = 2541) → pair (21, 2541)
  7. 33 divides 53361 (53361 ÷ 33 = 1617) → pair (33, 1617)
  8. 49 divides 53361 (53361 ÷ 49 = 1089) → pair (49, 1089)
  9. 63 divides 53361 (53361 ÷ 63 = 847) → pair (63, 847)
  10. 77 divides 53361 (53361 ÷ 77 = 693) → pair (77, 693)
  11. 99 divides 53361 (53361 ÷ 99 = 539) → pair (99, 539)
  12. 121 divides 53361 (53361 ÷ 121 = 441) → pair (121, 441)
  13. 147 divides 53361 (53361 ÷ 147 = 363) → pair (147, 363)
  14. 231 divides 53361 (53361 ÷ 231 = 231) → pair (231, 231)
  15. Collect all unique values: {1, 3, 7, 9, 11, 21, 33, 49, 63, 77, 99, 121, 147, 231, 363, 441, 539, 693, 847, 1089, 1617, 2541, 4851, 5929, 7623, 17787, 53361} — total 27 divisors.
  16. Sum: 1 + 3 + 7 + 9 + 11 + 21 + 33 + 49 + 63 + 77 + 99 + 121 + 147 + 231 + 363 + 441 + 539 + 693 + 847 + 1089 + 1617 + 2541 + 4851 + 5929 + 7623 + 17787 + 53361 = 98553.

Nearby Examples

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

Related Operations for 53361

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