Divisors of 10248: All 32 Factors

Quick Answer

10248 has 32 divisors (factors): 1, 2, 3, 4, 6, 7, 8, 12, 14, 21, 24, 28, 42, 56, 61, 84, 122, 168, 183, 244, 366, 427, 488, 732, 854, 1281, 1464, 1708, 2562, 3416, 5124, 10248.

Sum: 29760.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 4, 6, 7, 8, 12, 14, 21, 24, 28, 42, 56, 61, 84, 122, 168, 183, 244, 366, 427, 488, 732, 854, 1281, 1464, 1708, 2562, 3416, 5124, 10248

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 10248

The number 10248 has 32 divisors:

1,  2,  3,  4,  6,  7,  8,  12,  14,  21,  24,  28,  42,  56,  61,  84,  122,  168,  183,  244,  366,  427,  488,  732,  854,  1281,  1464,  1708,  2562,  3416,  5124,  10248

Divisor Pairs of 10248

Each pair multiplies to 10248:

Factor 1×Factor 2=Product
1×10248=10248
2×5124=10248
3×3416=10248
4×2562=10248
6×1708=10248
7×1464=10248
8×1281=10248
12×854=10248
14×732=10248
21×488=10248
24×427=10248
28×366=10248
42×244=10248
56×183=10248
61×168=10248
84×122=10248

Number of Divisors

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

Sum of Divisors

σ(10248) = 1 + 2 + 3 + 4 + 6 + 7 + 8 + 12 + 14 + 21 + 24 + 28 + 42 + 56 + 61 + 84 + 122 + 168 + 183 + 244 + 366 + 427 + 488 + 732 + 854 + 1281 + 1464 + 1708 + 2562 + 3416 + 5124 + 10248 = 29760

Properties of 10248

  • 10248 is composite.
  • 10248 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 29760.

Common Divisors with Another Number?

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

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

  1. 1 divides 10248 (10248 ÷ 1 = 10248) → pair (1, 10248)
  2. 2 divides 10248 (10248 ÷ 2 = 5124) → pair (2, 5124)
  3. 3 divides 10248 (10248 ÷ 3 = 3416) → pair (3, 3416)
  4. 4 divides 10248 (10248 ÷ 4 = 2562) → pair (4, 2562)
  5. 6 divides 10248 (10248 ÷ 6 = 1708) → pair (6, 1708)
  6. 7 divides 10248 (10248 ÷ 7 = 1464) → pair (7, 1464)
  7. 8 divides 10248 (10248 ÷ 8 = 1281) → pair (8, 1281)
  8. 12 divides 10248 (10248 ÷ 12 = 854) → pair (12, 854)
  9. 14 divides 10248 (10248 ÷ 14 = 732) → pair (14, 732)
  10. 21 divides 10248 (10248 ÷ 21 = 488) → pair (21, 488)
  11. 24 divides 10248 (10248 ÷ 24 = 427) → pair (24, 427)
  12. 28 divides 10248 (10248 ÷ 28 = 366) → pair (28, 366)
  13. 42 divides 10248 (10248 ÷ 42 = 244) → pair (42, 244)
  14. 56 divides 10248 (10248 ÷ 56 = 183) → pair (56, 183)
  15. 61 divides 10248 (10248 ÷ 61 = 168) → pair (61, 168)
  16. 84 divides 10248 (10248 ÷ 84 = 122) → pair (84, 122)
  17. Collect all unique values: {1, 2, 3, 4, 6, 7, 8, 12, 14, 21, 24, 28, 42, 56, 61, 84, 122, 168, 183, 244, 366, 427, 488, 732, 854, 1281, 1464, 1708, 2562, 3416, 5124, 10248} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 4 + 6 + 7 + 8 + 12 + 14 + 21 + 24 + 28 + 42 + 56 + 61 + 84 + 122 + 168 + 183 + 244 + 366 + 427 + 488 + 732 + 854 + 1281 + 1464 + 1708 + 2562 + 3416 + 5124 + 10248 = 29760.

Nearby Examples

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

Related Operations for 10248

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