Divisors of 15498: All 32 Factors

Quick Answer

15498 has 32 divisors (factors): 1, 2, 3, 6, 7, 9, 14, 18, 21, 27, 41, 42, 54, 63, 82, 123, 126, 189, 246, 287, 369, 378, 574, 738, 861, 1107, 1722, 2214, 2583, 5166, 7749, 15498.

Sum: 40320.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 6, 7, 9, 14, 18, 21, 27, 41, 42, 54, 63, 82, 123, 126, 189, 246, 287, 369, 378, 574, 738, 861, 1107, 1722, 2214, 2583, 5166, 7749, 15498

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 15498

The number 15498 has 32 divisors:

1,  2,  3,  6,  7,  9,  14,  18,  21,  27,  41,  42,  54,  63,  82,  123,  126,  189,  246,  287,  369,  378,  574,  738,  861,  1107,  1722,  2214,  2583,  5166,  7749,  15498

Divisor Pairs of 15498

Each pair multiplies to 15498:

Factor 1×Factor 2=Product
1×15498=15498
2×7749=15498
3×5166=15498
6×2583=15498
7×2214=15498
9×1722=15498
14×1107=15498
18×861=15498
21×738=15498
27×574=15498
41×378=15498
42×369=15498
54×287=15498
63×246=15498
82×189=15498
123×126=15498

Number of Divisors

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

Sum of Divisors

σ(15498) = 1 + 2 + 3 + 6 + 7 + 9 + 14 + 18 + 21 + 27 + 41 + 42 + 54 + 63 + 82 + 123 + 126 + 189 + 246 + 287 + 369 + 378 + 574 + 738 + 861 + 1107 + 1722 + 2214 + 2583 + 5166 + 7749 + 15498 = 40320

Properties of 15498

  • 15498 is composite.
  • 15498 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 40320.

Common Divisors with Another Number?

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

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

  1. 1 divides 15498 (15498 ÷ 1 = 15498) → pair (1, 15498)
  2. 2 divides 15498 (15498 ÷ 2 = 7749) → pair (2, 7749)
  3. 3 divides 15498 (15498 ÷ 3 = 5166) → pair (3, 5166)
  4. 6 divides 15498 (15498 ÷ 6 = 2583) → pair (6, 2583)
  5. 7 divides 15498 (15498 ÷ 7 = 2214) → pair (7, 2214)
  6. 9 divides 15498 (15498 ÷ 9 = 1722) → pair (9, 1722)
  7. 14 divides 15498 (15498 ÷ 14 = 1107) → pair (14, 1107)
  8. 18 divides 15498 (15498 ÷ 18 = 861) → pair (18, 861)
  9. 21 divides 15498 (15498 ÷ 21 = 738) → pair (21, 738)
  10. 27 divides 15498 (15498 ÷ 27 = 574) → pair (27, 574)
  11. 41 divides 15498 (15498 ÷ 41 = 378) → pair (41, 378)
  12. 42 divides 15498 (15498 ÷ 42 = 369) → pair (42, 369)
  13. 54 divides 15498 (15498 ÷ 54 = 287) → pair (54, 287)
  14. 63 divides 15498 (15498 ÷ 63 = 246) → pair (63, 246)
  15. 82 divides 15498 (15498 ÷ 82 = 189) → pair (82, 189)
  16. 123 divides 15498 (15498 ÷ 123 = 126) → pair (123, 126)
  17. Collect all unique values: {1, 2, 3, 6, 7, 9, 14, 18, 21, 27, 41, 42, 54, 63, 82, 123, 126, 189, 246, 287, 369, 378, 574, 738, 861, 1107, 1722, 2214, 2583, 5166, 7749, 15498} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 6 + 7 + 9 + 14 + 18 + 21 + 27 + 41 + 42 + 54 + 63 + 82 + 123 + 126 + 189 + 246 + 287 + 369 + 378 + 574 + 738 + 861 + 1107 + 1722 + 2214 + 2583 + 5166 + 7749 + 15498 = 40320.

Nearby Examples

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

Related Operations for 15498

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