Divisors of 3168: All 36 Factors

Quick Answer

3168 has 36 divisors (factors): 1, 2, 3, 4, 6, 8, 9, 11, 12, 16, 18, 22, 24, 32, 33, 36, 44, 48, 66, 72, 88, 96, 99, 132, 144, 176, 198, 264, 288, 352, 396, 528, 792, 1056, 1584, 3168.

Sum: 9828.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 3, 4, 6, 8, 9, 11, 12, 16, 18, 22, 24, 32, 33, 36, 44, 48, 66, 72, 88, 96, 99, 132, 144, 176, 198, 264, 288, 352, 396, 528, 792, 1056, 1584, 3168

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 3168

The number 3168 has 36 divisors:

1,  2,  3,  4,  6,  8,  9,  11,  12,  16,  18,  22,  24,  32,  33,  36,  44,  48,  66,  72,  88,  96,  99,  132,  144,  176,  198,  264,  288,  352,  396,  528,  792,  1056,  1584,  3168

Divisor Pairs of 3168

Each pair multiplies to 3168:

Factor 1×Factor 2=Product
1×3168=3168
2×1584=3168
3×1056=3168
4×792=3168
6×528=3168
8×396=3168
9×352=3168
11×288=3168
12×264=3168
16×198=3168
18×176=3168
22×144=3168
24×132=3168
32×99=3168
33×96=3168
36×88=3168
44×72=3168
48×66=3168

Number of Divisors

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

Sum of Divisors

σ(3168) = 1 + 2 + 3 + 4 + 6 + 8 + 9 + 11 + 12 + 16 + 18 + 22 + 24 + 32 + 33 + 36 + 44 + 48 + 66 + 72 + 88 + 96 + 99 + 132 + 144 + 176 + 198 + 264 + 288 + 352 + 396 + 528 + 792 + 1056 + 1584 + 3168 = 9828

Properties of 3168

  • 3168 is composite.
  • 3168 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 9828.

Common Divisors with Another Number?

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

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

  1. 1 divides 3168 (3168 ÷ 1 = 3168) → pair (1, 3168)
  2. 2 divides 3168 (3168 ÷ 2 = 1584) → pair (2, 1584)
  3. 3 divides 3168 (3168 ÷ 3 = 1056) → pair (3, 1056)
  4. 4 divides 3168 (3168 ÷ 4 = 792) → pair (4, 792)
  5. 6 divides 3168 (3168 ÷ 6 = 528) → pair (6, 528)
  6. 8 divides 3168 (3168 ÷ 8 = 396) → pair (8, 396)
  7. 9 divides 3168 (3168 ÷ 9 = 352) → pair (9, 352)
  8. 11 divides 3168 (3168 ÷ 11 = 288) → pair (11, 288)
  9. 12 divides 3168 (3168 ÷ 12 = 264) → pair (12, 264)
  10. 16 divides 3168 (3168 ÷ 16 = 198) → pair (16, 198)
  11. 18 divides 3168 (3168 ÷ 18 = 176) → pair (18, 176)
  12. 22 divides 3168 (3168 ÷ 22 = 144) → pair (22, 144)
  13. 24 divides 3168 (3168 ÷ 24 = 132) → pair (24, 132)
  14. 32 divides 3168 (3168 ÷ 32 = 99) → pair (32, 99)
  15. 33 divides 3168 (3168 ÷ 33 = 96) → pair (33, 96)
  16. 36 divides 3168 (3168 ÷ 36 = 88) → pair (36, 88)
  17. 44 divides 3168 (3168 ÷ 44 = 72) → pair (44, 72)
  18. 48 divides 3168 (3168 ÷ 48 = 66) → pair (48, 66)
  19. Collect all unique values: {1, 2, 3, 4, 6, 8, 9, 11, 12, 16, 18, 22, 24, 32, 33, 36, 44, 48, 66, 72, 88, 96, 99, 132, 144, 176, 198, 264, 288, 352, 396, 528, 792, 1056, 1584, 3168} — total 36 divisors.
  20. Sum: 1 + 2 + 3 + 4 + 6 + 8 + 9 + 11 + 12 + 16 + 18 + 22 + 24 + 32 + 33 + 36 + 44 + 48 + 66 + 72 + 88 + 96 + 99 + 132 + 144 + 176 + 198 + 264 + 288 + 352 + 396 + 528 + 792 + 1056 + 1584 + 3168 = 9828.

Nearby Examples

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

Related Operations for 3168

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