Divisors of 3696: All 40 Factors

Quick Answer

3696 has 40 divisors (factors): 1, 2, 3, 4, 6, 7, 8, 11, 12, 14, 16, 21, 22, 24, 28, 33, 42, 44, 48, 56, 66, 77, 84, 88, 112, 132, 154, 168, 176, 231, 264, 308, 336, 462, 528, 616, 924, 1232, 1848, 3696.

Sum: 11904.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
40 divisors
1, 2, 3, 4, 6, 7, 8, 11, 12, 14, 16, 21, 22, 24, 28, 33, 42, 44, 48, 56, 66, 77, 84, 88, 112, 132, 154, 168, 176, 231, 264, 308, 336, 462, 528, 616, 924, 1232, 1848, 3696

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 3696

The number 3696 has 40 divisors:

1,  2,  3,  4,  6,  7,  8,  11,  12,  14,  16,  21,  22,  24,  28,  33,  42,  44,  48,  56,  66,  77,  84,  88,  112,  132,  154,  168,  176,  231,  264,  308,  336,  462,  528,  616,  924,  1232,  1848,  3696

Divisor Pairs of 3696

Each pair multiplies to 3696:

Factor 1×Factor 2=Product
1×3696=3696
2×1848=3696
3×1232=3696
4×924=3696
6×616=3696
7×528=3696
8×462=3696
11×336=3696
12×308=3696
14×264=3696
16×231=3696
21×176=3696
22×168=3696
24×154=3696
28×132=3696
33×112=3696
42×88=3696
44×84=3696
48×77=3696
56×66=3696

Number of Divisors

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

Sum of Divisors

σ(3696) = 1 + 2 + 3 + 4 + 6 + 7 + 8 + 11 + 12 + 14 + 16 + 21 + 22 + 24 + 28 + 33 + 42 + 44 + 48 + 56 + 66 + 77 + 84 + 88 + 112 + 132 + 154 + 168 + 176 + 231 + 264 + 308 + 336 + 462 + 528 + 616 + 924 + 1232 + 1848 + 3696 = 11904

Properties of 3696

  • 3696 is composite.
  • 3696 is not a perfect square.
  • Number of divisors: 40.
  • Sum of divisors: 11904.

Common Divisors with Another Number?

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

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

  1. 1 divides 3696 (3696 ÷ 1 = 3696) → pair (1, 3696)
  2. 2 divides 3696 (3696 ÷ 2 = 1848) → pair (2, 1848)
  3. 3 divides 3696 (3696 ÷ 3 = 1232) → pair (3, 1232)
  4. 4 divides 3696 (3696 ÷ 4 = 924) → pair (4, 924)
  5. 6 divides 3696 (3696 ÷ 6 = 616) → pair (6, 616)
  6. 7 divides 3696 (3696 ÷ 7 = 528) → pair (7, 528)
  7. 8 divides 3696 (3696 ÷ 8 = 462) → pair (8, 462)
  8. 11 divides 3696 (3696 ÷ 11 = 336) → pair (11, 336)
  9. 12 divides 3696 (3696 ÷ 12 = 308) → pair (12, 308)
  10. 14 divides 3696 (3696 ÷ 14 = 264) → pair (14, 264)
  11. 16 divides 3696 (3696 ÷ 16 = 231) → pair (16, 231)
  12. 21 divides 3696 (3696 ÷ 21 = 176) → pair (21, 176)
  13. 22 divides 3696 (3696 ÷ 22 = 168) → pair (22, 168)
  14. 24 divides 3696 (3696 ÷ 24 = 154) → pair (24, 154)
  15. 28 divides 3696 (3696 ÷ 28 = 132) → pair (28, 132)
  16. 33 divides 3696 (3696 ÷ 33 = 112) → pair (33, 112)
  17. 42 divides 3696 (3696 ÷ 42 = 88) → pair (42, 88)
  18. 44 divides 3696 (3696 ÷ 44 = 84) → pair (44, 84)
  19. 48 divides 3696 (3696 ÷ 48 = 77) → pair (48, 77)
  20. 56 divides 3696 (3696 ÷ 56 = 66) → pair (56, 66)
  21. Collect all unique values: {1, 2, 3, 4, 6, 7, 8, 11, 12, 14, 16, 21, 22, 24, 28, 33, 42, 44, 48, 56, 66, 77, 84, 88, 112, 132, 154, 168, 176, 231, 264, 308, 336, 462, 528, 616, 924, 1232, 1848, 3696} — total 40 divisors.
  22. Sum: 1 + 2 + 3 + 4 + 6 + 7 + 8 + 11 + 12 + 14 + 16 + 21 + 22 + 24 + 28 + 33 + 42 + 44 + 48 + 56 + 66 + 77 + 84 + 88 + 112 + 132 + 154 + 168 + 176 + 231 + 264 + 308 + 336 + 462 + 528 + 616 + 924 + 1232 + 1848 + 3696 = 11904.

Nearby Examples

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

Related Operations for 3696

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