Divisors of 5616: All 40 Factors

Quick Answer

5616 has 40 divisors (factors): 1, 2, 3, 4, 6, 8, 9, 12, 13, 16, 18, 24, 26, 27, 36, 39, 48, 52, 54, 72, 78, 104, 108, 117, 144, 156, 208, 216, 234, 312, 351, 432, 468, 624, 702, 936, 1404, 1872, 2808, 5616.

Sum: 17360.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
40 divisors
1, 2, 3, 4, 6, 8, 9, 12, 13, 16, 18, 24, 26, 27, 36, 39, 48, 52, 54, 72, 78, 104, 108, 117, 144, 156, 208, 216, 234, 312, 351, 432, 468, 624, 702, 936, 1404, 1872, 2808, 5616

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 5616

The number 5616 has 40 divisors:

1,  2,  3,  4,  6,  8,  9,  12,  13,  16,  18,  24,  26,  27,  36,  39,  48,  52,  54,  72,  78,  104,  108,  117,  144,  156,  208,  216,  234,  312,  351,  432,  468,  624,  702,  936,  1404,  1872,  2808,  5616

Divisor Pairs of 5616

Each pair multiplies to 5616:

Factor 1×Factor 2=Product
1×5616=5616
2×2808=5616
3×1872=5616
4×1404=5616
6×936=5616
8×702=5616
9×624=5616
12×468=5616
13×432=5616
16×351=5616
18×312=5616
24×234=5616
26×216=5616
27×208=5616
36×156=5616
39×144=5616
48×117=5616
52×108=5616
54×104=5616
72×78=5616

Number of Divisors

The number 5616 has 40 divisors, written as τ(5616) = 40 in number theory.

Sum of Divisors

σ(5616) = 1 + 2 + 3 + 4 + 6 + 8 + 9 + 12 + 13 + 16 + 18 + 24 + 26 + 27 + 36 + 39 + 48 + 52 + 54 + 72 + 78 + 104 + 108 + 117 + 144 + 156 + 208 + 216 + 234 + 312 + 351 + 432 + 468 + 624 + 702 + 936 + 1404 + 1872 + 2808 + 5616 = 17360

Properties of 5616

  • 5616 is composite.
  • 5616 is not a perfect square.
  • Number of divisors: 40.
  • Sum of divisors: 17360.

Common Divisors with Another Number?

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

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

  1. 1 divides 5616 (5616 ÷ 1 = 5616) → pair (1, 5616)
  2. 2 divides 5616 (5616 ÷ 2 = 2808) → pair (2, 2808)
  3. 3 divides 5616 (5616 ÷ 3 = 1872) → pair (3, 1872)
  4. 4 divides 5616 (5616 ÷ 4 = 1404) → pair (4, 1404)
  5. 6 divides 5616 (5616 ÷ 6 = 936) → pair (6, 936)
  6. 8 divides 5616 (5616 ÷ 8 = 702) → pair (8, 702)
  7. 9 divides 5616 (5616 ÷ 9 = 624) → pair (9, 624)
  8. 12 divides 5616 (5616 ÷ 12 = 468) → pair (12, 468)
  9. 13 divides 5616 (5616 ÷ 13 = 432) → pair (13, 432)
  10. 16 divides 5616 (5616 ÷ 16 = 351) → pair (16, 351)
  11. 18 divides 5616 (5616 ÷ 18 = 312) → pair (18, 312)
  12. 24 divides 5616 (5616 ÷ 24 = 234) → pair (24, 234)
  13. 26 divides 5616 (5616 ÷ 26 = 216) → pair (26, 216)
  14. 27 divides 5616 (5616 ÷ 27 = 208) → pair (27, 208)
  15. 36 divides 5616 (5616 ÷ 36 = 156) → pair (36, 156)
  16. 39 divides 5616 (5616 ÷ 39 = 144) → pair (39, 144)
  17. 48 divides 5616 (5616 ÷ 48 = 117) → pair (48, 117)
  18. 52 divides 5616 (5616 ÷ 52 = 108) → pair (52, 108)
  19. 54 divides 5616 (5616 ÷ 54 = 104) → pair (54, 104)
  20. 72 divides 5616 (5616 ÷ 72 = 78) → pair (72, 78)
  21. Collect all unique values: {1, 2, 3, 4, 6, 8, 9, 12, 13, 16, 18, 24, 26, 27, 36, 39, 48, 52, 54, 72, 78, 104, 108, 117, 144, 156, 208, 216, 234, 312, 351, 432, 468, 624, 702, 936, 1404, 1872, 2808, 5616} — total 40 divisors.
  22. Sum: 1 + 2 + 3 + 4 + 6 + 8 + 9 + 12 + 13 + 16 + 18 + 24 + 26 + 27 + 36 + 39 + 48 + 52 + 54 + 72 + 78 + 104 + 108 + 117 + 144 + 156 + 208 + 216 + 234 + 312 + 351 + 432 + 468 + 624 + 702 + 936 + 1404 + 1872 + 2808 + 5616 = 17360.

Nearby Examples

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

Related Operations for 5616

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