Divisors of 51516: All 36 Factors

Quick Answer

51516 has 36 divisors (factors): 1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 53, 54, 81, 106, 108, 159, 162, 212, 243, 318, 324, 477, 486, 636, 954, 972, 1431, 1908, 2862, 4293, 5724, 8586, 12879, 17172, 25758, 51516.

Sum: 137592.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 53, 54, 81, 106, 108, 159, 162, 212, 243, 318, 324, 477, 486, 636, 954, 972, 1431, 1908, 2862, 4293, 5724, 8586, 12879, 17172, 25758, 51516

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 51516

The number 51516 has 36 divisors:

1,  2,  3,  4,  6,  9,  12,  18,  27,  36,  53,  54,  81,  106,  108,  159,  162,  212,  243,  318,  324,  477,  486,  636,  954,  972,  1431,  1908,  2862,  4293,  5724,  8586,  12879,  17172,  25758,  51516

Divisor Pairs of 51516

Each pair multiplies to 51516:

Factor 1×Factor 2=Product
1×51516=51516
2×25758=51516
3×17172=51516
4×12879=51516
6×8586=51516
9×5724=51516
12×4293=51516
18×2862=51516
27×1908=51516
36×1431=51516
53×972=51516
54×954=51516
81×636=51516
106×486=51516
108×477=51516
159×324=51516
162×318=51516
212×243=51516

Number of Divisors

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

Sum of Divisors

σ(51516) = 1 + 2 + 3 + 4 + 6 + 9 + 12 + 18 + 27 + 36 + 53 + 54 + 81 + 106 + 108 + 159 + 162 + 212 + 243 + 318 + 324 + 477 + 486 + 636 + 954 + 972 + 1431 + 1908 + 2862 + 4293 + 5724 + 8586 + 12879 + 17172 + 25758 + 51516 = 137592

Properties of 51516

  • 51516 is composite.
  • 51516 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 137592.

Common Divisors with Another Number?

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

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

  1. 1 divides 51516 (51516 ÷ 1 = 51516) → pair (1, 51516)
  2. 2 divides 51516 (51516 ÷ 2 = 25758) → pair (2, 25758)
  3. 3 divides 51516 (51516 ÷ 3 = 17172) → pair (3, 17172)
  4. 4 divides 51516 (51516 ÷ 4 = 12879) → pair (4, 12879)
  5. 6 divides 51516 (51516 ÷ 6 = 8586) → pair (6, 8586)
  6. 9 divides 51516 (51516 ÷ 9 = 5724) → pair (9, 5724)
  7. 12 divides 51516 (51516 ÷ 12 = 4293) → pair (12, 4293)
  8. 18 divides 51516 (51516 ÷ 18 = 2862) → pair (18, 2862)
  9. 27 divides 51516 (51516 ÷ 27 = 1908) → pair (27, 1908)
  10. 36 divides 51516 (51516 ÷ 36 = 1431) → pair (36, 1431)
  11. 53 divides 51516 (51516 ÷ 53 = 972) → pair (53, 972)
  12. 54 divides 51516 (51516 ÷ 54 = 954) → pair (54, 954)
  13. 81 divides 51516 (51516 ÷ 81 = 636) → pair (81, 636)
  14. 106 divides 51516 (51516 ÷ 106 = 486) → pair (106, 486)
  15. 108 divides 51516 (51516 ÷ 108 = 477) → pair (108, 477)
  16. 159 divides 51516 (51516 ÷ 159 = 324) → pair (159, 324)
  17. 162 divides 51516 (51516 ÷ 162 = 318) → pair (162, 318)
  18. 212 divides 51516 (51516 ÷ 212 = 243) → pair (212, 243)
  19. Collect all unique values: {1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 53, 54, 81, 106, 108, 159, 162, 212, 243, 318, 324, 477, 486, 636, 954, 972, 1431, 1908, 2862, 4293, 5724, 8586, 12879, 17172, 25758, 51516} — total 36 divisors.
  20. Sum: 1 + 2 + 3 + 4 + 6 + 9 + 12 + 18 + 27 + 36 + 53 + 54 + 81 + 106 + 108 + 159 + 162 + 212 + 243 + 318 + 324 + 477 + 486 + 636 + 954 + 972 + 1431 + 1908 + 2862 + 4293 + 5724 + 8586 + 12879 + 17172 + 25758 + 51516 = 137592.

Nearby Examples

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

Related Operations for 51516

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