Divisors of 1681: All 3 Factors

Divisors (Factors) Calculator

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 1681

The number 1681 has 3 divisors:

1,  41,  1681

Divisor Pairs of 1681

Each pair multiplies to 1681:

Note: the last pair has identical factors (41 × 41) because 1681 is a perfect square.

Number of Divisors

The number 1681 has 3 divisors, written as τ(1681) = 3 in number theory.

⚡ Notice: 1681 has an odd number of divisors — this means 1681 is a perfect square (√1681 = 41).

Sum of Divisors

σ(1681) = 1 + 41 + 1681 = 1723

Prime Factorization of 1681

See the full prime factorization calculator →

Properties of 1681

• 1681 is composite.
• 1681 is a perfect square (√1681 = 41).
• Number of divisors: 3.
• Sum of divisors: 1723.

Common Divisors with Another Number?

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

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

1. 1 divides 1681 (1681 ÷ 1 = 1681) → pair (1, 1681)
2. 41 divides 1681 (1681 ÷ 41 = 41) → pair (41, 41)
3. Collect all unique values: {1, 41, 1681} — total 3 divisors.
4. Sum: 1 + 41 + 1681 = 1723.

Nearby Examples

Related Operations for 1681

• Multiples of 1681 — "outward" complement; M is a multiple of 1681 ⇔ 1681 is a divisor of M
• 1681 Prime Factorization — decompose into prime building blocks
• Find GCF of 1681 and another number
• Find LCM of 1681 and another number
• Is 1681 a perfect square? (odd divisor count ⇔ yes)

See also our tables of divisors:

• Table of all divisors from 1 to 100
• Table of all divisors from 1 to 500
• Table of all divisors from 1 to 1,000
• Table of all divisors from 1 to 10,000

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.

References

• [1] Divisor (Wikipedia)
• [2] Divisor function (Wikipedia)
• [3] Divisor (Wolfram MathWorld)

Divisors Calculation Examples

Find all divisors of these numbers: