Divisors of 28968: All 32 Factors

Quick Answer

28968 has 32 divisors (factors): 1, 2, 3, 4, 6, 8, 12, 17, 24, 34, 51, 68, 71, 102, 136, 142, 204, 213, 284, 408, 426, 568, 852, 1207, 1704, 2414, 3621, 4828, 7242, 9656, 14484, 28968.

Sum: 77760.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 4, 6, 8, 12, 17, 24, 34, 51, 68, 71, 102, 136, 142, 204, 213, 284, 408, 426, 568, 852, 1207, 1704, 2414, 3621, 4828, 7242, 9656, 14484, 28968

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 28968

The number 28968 has 32 divisors:

1,  2,  3,  4,  6,  8,  12,  17,  24,  34,  51,  68,  71,  102,  136,  142,  204,  213,  284,  408,  426,  568,  852,  1207,  1704,  2414,  3621,  4828,  7242,  9656,  14484,  28968

Divisor Pairs of 28968

Each pair multiplies to 28968:

Factor 1×Factor 2=Product
1×28968=28968
2×14484=28968
3×9656=28968
4×7242=28968
6×4828=28968
8×3621=28968
12×2414=28968
17×1704=28968
24×1207=28968
34×852=28968
51×568=28968
68×426=28968
71×408=28968
102×284=28968
136×213=28968
142×204=28968

Number of Divisors

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

Sum of Divisors

σ(28968) = 1 + 2 + 3 + 4 + 6 + 8 + 12 + 17 + 24 + 34 + 51 + 68 + 71 + 102 + 136 + 142 + 204 + 213 + 284 + 408 + 426 + 568 + 852 + 1207 + 1704 + 2414 + 3621 + 4828 + 7242 + 9656 + 14484 + 28968 = 77760

Properties of 28968

  • 28968 is composite.
  • 28968 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 77760.

Common Divisors with Another Number?

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

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

  1. 1 divides 28968 (28968 ÷ 1 = 28968) → pair (1, 28968)
  2. 2 divides 28968 (28968 ÷ 2 = 14484) → pair (2, 14484)
  3. 3 divides 28968 (28968 ÷ 3 = 9656) → pair (3, 9656)
  4. 4 divides 28968 (28968 ÷ 4 = 7242) → pair (4, 7242)
  5. 6 divides 28968 (28968 ÷ 6 = 4828) → pair (6, 4828)
  6. 8 divides 28968 (28968 ÷ 8 = 3621) → pair (8, 3621)
  7. 12 divides 28968 (28968 ÷ 12 = 2414) → pair (12, 2414)
  8. 17 divides 28968 (28968 ÷ 17 = 1704) → pair (17, 1704)
  9. 24 divides 28968 (28968 ÷ 24 = 1207) → pair (24, 1207)
  10. 34 divides 28968 (28968 ÷ 34 = 852) → pair (34, 852)
  11. 51 divides 28968 (28968 ÷ 51 = 568) → pair (51, 568)
  12. 68 divides 28968 (28968 ÷ 68 = 426) → pair (68, 426)
  13. 71 divides 28968 (28968 ÷ 71 = 408) → pair (71, 408)
  14. 102 divides 28968 (28968 ÷ 102 = 284) → pair (102, 284)
  15. 136 divides 28968 (28968 ÷ 136 = 213) → pair (136, 213)
  16. 142 divides 28968 (28968 ÷ 142 = 204) → pair (142, 204)
  17. Collect all unique values: {1, 2, 3, 4, 6, 8, 12, 17, 24, 34, 51, 68, 71, 102, 136, 142, 204, 213, 284, 408, 426, 568, 852, 1207, 1704, 2414, 3621, 4828, 7242, 9656, 14484, 28968} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 4 + 6 + 8 + 12 + 17 + 24 + 34 + 51 + 68 + 71 + 102 + 136 + 142 + 204 + 213 + 284 + 408 + 426 + 568 + 852 + 1207 + 1704 + 2414 + 3621 + 4828 + 7242 + 9656 + 14484 + 28968 = 77760.

Nearby Examples

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

Related Operations for 28968

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