Divisors of 537: All 4 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 537

The number 537 has 4 divisors:

1,  3,  179,  537

Divisor Pairs of 537

Each pair multiplies to 537:

Number of Divisors

The number 537 has 4 divisors, written as τ(537) = 4 in number theory.

Sum of Divisors

σ(537) = 1 + 3 + 179 + 537 = 720

Prime Factorization of 537

See the full prime factorization calculator →

Properties of 537

• 537 is composite.
• 537 is not a perfect square.
• Number of divisors: 4.
• Sum of divisors: 720.

Common Divisors with Another Number?

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

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

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

Nearby Examples

Related Operations for 537

• Multiples of 537 — "outward" complement; M is a multiple of 537 ⇔ 537 is a divisor of M
• 537 Prime Factorization — decompose into prime building blocks
• Find GCF of 537 and another number
• Find LCM of 537 and another number
• Is 537 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: