Divisors of 1659: All 8 Factors

Quick Answer

1659 has 8 divisors (factors): 1, 3, 7, 21, 79, 237, 553, 1659.

Sum: 2560.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
8 divisors
1, 3, 7, 21, 79, 237, 553, 1659

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 1659

The number 1659 has 8 divisors:

1,  3,  7,  21,  79,  237,  553,  1659

Divisor Pairs of 1659

Each pair multiplies to 1659:

Factor 1×Factor 2=Product
1×1659=1659
3×553=1659
7×237=1659
21×79=1659

Number of Divisors

The number 1659 has 8 divisors, written as τ(1659) = 8 in number theory.

Sum of Divisors

σ(1659) = 1 + 3 + 7 + 21 + 79 + 237 + 553 + 1659 = 2560

Properties of 1659

  • 1659 is composite.
  • 1659 is not a perfect square.
  • Number of divisors: 8.
  • Sum of divisors: 2560.

Common Divisors with Another Number?

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

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

  1. 1 divides 1659 (1659 ÷ 1 = 1659) → pair (1, 1659)
  2. 3 divides 1659 (1659 ÷ 3 = 553) → pair (3, 553)
  3. 7 divides 1659 (1659 ÷ 7 = 237) → pair (7, 237)
  4. 21 divides 1659 (1659 ÷ 21 = 79) → pair (21, 79)
  5. Collect all unique values: {1, 3, 7, 21, 79, 237, 553, 1659} — total 8 divisors.
  6. Sum: 1 + 3 + 7 + 21 + 79 + 237 + 553 + 1659 = 2560.

Nearby Examples

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

Related Operations for 1659

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