Divisors of 49005: All 30 Factors

Quick Answer

49005 has 30 divisors (factors): 1, 3, 5, 9, 11, 15, 27, 33, 45, 55, 81, 99, 121, 135, 165, 297, 363, 405, 495, 605, 891, 1089, 1485, 1815, 3267, 4455, 5445, 9801, 16335, 49005.

Sum: 96558.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
30 divisors
1, 3, 5, 9, 11, 15, 27, 33, 45, 55, 81, 99, 121, 135, 165, 297, 363, 405, 495, 605, 891, 1089, 1485, 1815, 3267, 4455, 5445, 9801, 16335, 49005

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 49005

The number 49005 has 30 divisors:

1,  3,  5,  9,  11,  15,  27,  33,  45,  55,  81,  99,  121,  135,  165,  297,  363,  405,  495,  605,  891,  1089,  1485,  1815,  3267,  4455,  5445,  9801,  16335,  49005

Divisor Pairs of 49005

Each pair multiplies to 49005:

Factor 1×Factor 2=Product
1×49005=49005
3×16335=49005
5×9801=49005
9×5445=49005
11×4455=49005
15×3267=49005
27×1815=49005
33×1485=49005
45×1089=49005
55×891=49005
81×605=49005
99×495=49005
121×405=49005
135×363=49005
165×297=49005

Number of Divisors

The number 49005 has 30 divisors, written as τ(49005) = 30 in number theory.

Sum of Divisors

σ(49005) = 1 + 3 + 5 + 9 + 11 + 15 + 27 + 33 + 45 + 55 + 81 + 99 + 121 + 135 + 165 + 297 + 363 + 405 + 495 + 605 + 891 + 1089 + 1485 + 1815 + 3267 + 4455 + 5445 + 9801 + 16335 + 49005 = 96558

Properties of 49005

  • 49005 is composite.
  • 49005 is not a perfect square.
  • Number of divisors: 30.
  • Sum of divisors: 96558.

Common Divisors with Another Number?

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

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

  1. 1 divides 49005 (49005 ÷ 1 = 49005) → pair (1, 49005)
  2. 3 divides 49005 (49005 ÷ 3 = 16335) → pair (3, 16335)
  3. 5 divides 49005 (49005 ÷ 5 = 9801) → pair (5, 9801)
  4. 9 divides 49005 (49005 ÷ 9 = 5445) → pair (9, 5445)
  5. 11 divides 49005 (49005 ÷ 11 = 4455) → pair (11, 4455)
  6. 15 divides 49005 (49005 ÷ 15 = 3267) → pair (15, 3267)
  7. 27 divides 49005 (49005 ÷ 27 = 1815) → pair (27, 1815)
  8. 33 divides 49005 (49005 ÷ 33 = 1485) → pair (33, 1485)
  9. 45 divides 49005 (49005 ÷ 45 = 1089) → pair (45, 1089)
  10. 55 divides 49005 (49005 ÷ 55 = 891) → pair (55, 891)
  11. 81 divides 49005 (49005 ÷ 81 = 605) → pair (81, 605)
  12. 99 divides 49005 (49005 ÷ 99 = 495) → pair (99, 495)
  13. 121 divides 49005 (49005 ÷ 121 = 405) → pair (121, 405)
  14. 135 divides 49005 (49005 ÷ 135 = 363) → pair (135, 363)
  15. 165 divides 49005 (49005 ÷ 165 = 297) → pair (165, 297)
  16. Collect all unique values: {1, 3, 5, 9, 11, 15, 27, 33, 45, 55, 81, 99, 121, 135, 165, 297, 363, 405, 495, 605, 891, 1089, 1485, 1815, 3267, 4455, 5445, 9801, 16335, 49005} — total 30 divisors.
  17. Sum: 1 + 3 + 5 + 9 + 11 + 15 + 27 + 33 + 45 + 55 + 81 + 99 + 121 + 135 + 165 + 297 + 363 + 405 + 495 + 605 + 891 + 1089 + 1485 + 1815 + 3267 + 4455 + 5445 + 9801 + 16335 + 49005 = 96558.

Nearby Examples

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

Related Operations for 49005

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