Divisors of 89: 2 Factors (Prime)
Quick Answer
89 is a prime number, so it has only 2 divisors: 1 and 89. Sum: 90.
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 89
89 is prime, so it has exactly 2 divisors:
1, 89
Divisor Pairs of 89
Each pair multiplies to 89:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 89 | = | 89 |
Number of Divisors
The number 89 has 2 divisors, written as τ(89) = 2 in number theory.
Sum of Divisors
σ(89) = 1 + 89 = 90
Prime Factorization of 89
Properties of 89
- 89 is prime.
- 89 is not a perfect square.
- Number of divisors: 2.
- Sum of divisors: 90.
Common Divisors with Another Number?
Looking for the divisors that 89 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 89
- By definition, a prime number is divisible only by 1 and itself.
- Check small divisors: we only need to test integers from 2 to √89 ≈ 9.43.
- None of those divide 89 evenly ⇒ 89 is prime.
- Divisors of 89: {1, 89}. Sum: 90.
Nearby Examples
Related Operations for 89
- Multiples of 89 — "outward" complement; M is a multiple of 89 ⇔ 89 is a divisor of M
- 89 Prime Factorization — decompose into prime building blocks
- Is 89 a perfect square? (odd divisor count ⇔ yes)
See also our tables of divisors:
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
- Multiples of a Number — "outward" complement
- Prime Factorization — product of prime divisors
- Greatest Common Factor (GCF) — largest common divisor of 2+ numbers
- Least Common Multiple (LCM) — smallest common multiple
- Is N a Perfect Square? — odd divisor count check