Divisors of 3602: 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 3602

The number 3602 has 4 divisors:

1,  2,  1801,  3602

Divisor Pairs of 3602

Each pair multiplies to 3602:

Number of Divisors

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

Sum of Divisors

σ(3602) = 1 + 2 + 1801 + 3602 = 5406

Prime Factorization of 3602

See the full prime factorization calculator →

Properties of 3602

• 3602 is composite.
• 3602 is not a perfect square.
• Number of divisors: 4.
• Sum of divisors: 5406.

Common Divisors with Another Number?

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

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

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

Nearby Examples

Related Operations for 3602

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