Divisors of 15768: All 32 Factors

Quick Answer

15768 has 32 divisors (factors): 1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 27, 36, 54, 72, 73, 108, 146, 216, 219, 292, 438, 584, 657, 876, 1314, 1752, 1971, 2628, 3942, 5256, 7884, 15768.

Sum: 44400.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 27, 36, 54, 72, 73, 108, 146, 216, 219, 292, 438, 584, 657, 876, 1314, 1752, 1971, 2628, 3942, 5256, 7884, 15768

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 15768

The number 15768 has 32 divisors:

1,  2,  3,  4,  6,  8,  9,  12,  18,  24,  27,  36,  54,  72,  73,  108,  146,  216,  219,  292,  438,  584,  657,  876,  1314,  1752,  1971,  2628,  3942,  5256,  7884,  15768

Divisor Pairs of 15768

Each pair multiplies to 15768:

Factor 1×Factor 2=Product
1×15768=15768
2×7884=15768
3×5256=15768
4×3942=15768
6×2628=15768
8×1971=15768
9×1752=15768
12×1314=15768
18×876=15768
24×657=15768
27×584=15768
36×438=15768
54×292=15768
72×219=15768
73×216=15768
108×146=15768

Number of Divisors

The number 15768 has 32 divisors, written as τ(15768) = 32 in number theory.

Sum of Divisors

σ(15768) = 1 + 2 + 3 + 4 + 6 + 8 + 9 + 12 + 18 + 24 + 27 + 36 + 54 + 72 + 73 + 108 + 146 + 216 + 219 + 292 + 438 + 584 + 657 + 876 + 1314 + 1752 + 1971 + 2628 + 3942 + 5256 + 7884 + 15768 = 44400

Properties of 15768

  • 15768 is composite.
  • 15768 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 44400.

Common Divisors with Another Number?

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

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

  1. 1 divides 15768 (15768 ÷ 1 = 15768) → pair (1, 15768)
  2. 2 divides 15768 (15768 ÷ 2 = 7884) → pair (2, 7884)
  3. 3 divides 15768 (15768 ÷ 3 = 5256) → pair (3, 5256)
  4. 4 divides 15768 (15768 ÷ 4 = 3942) → pair (4, 3942)
  5. 6 divides 15768 (15768 ÷ 6 = 2628) → pair (6, 2628)
  6. 8 divides 15768 (15768 ÷ 8 = 1971) → pair (8, 1971)
  7. 9 divides 15768 (15768 ÷ 9 = 1752) → pair (9, 1752)
  8. 12 divides 15768 (15768 ÷ 12 = 1314) → pair (12, 1314)
  9. 18 divides 15768 (15768 ÷ 18 = 876) → pair (18, 876)
  10. 24 divides 15768 (15768 ÷ 24 = 657) → pair (24, 657)
  11. 27 divides 15768 (15768 ÷ 27 = 584) → pair (27, 584)
  12. 36 divides 15768 (15768 ÷ 36 = 438) → pair (36, 438)
  13. 54 divides 15768 (15768 ÷ 54 = 292) → pair (54, 292)
  14. 72 divides 15768 (15768 ÷ 72 = 219) → pair (72, 219)
  15. 73 divides 15768 (15768 ÷ 73 = 216) → pair (73, 216)
  16. 108 divides 15768 (15768 ÷ 108 = 146) → pair (108, 146)
  17. Collect all unique values: {1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 27, 36, 54, 72, 73, 108, 146, 216, 219, 292, 438, 584, 657, 876, 1314, 1752, 1971, 2628, 3942, 5256, 7884, 15768} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 4 + 6 + 8 + 9 + 12 + 18 + 24 + 27 + 36 + 54 + 72 + 73 + 108 + 146 + 216 + 219 + 292 + 438 + 584 + 657 + 876 + 1314 + 1752 + 1971 + 2628 + 3942 + 5256 + 7884 + 15768 = 44400.

Nearby Examples

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

Related Operations for 15768

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