Divisors of 297: All 8 Factors
Quick Answer
297 has 8 divisors (factors): 1, 3, 9, 11, 27, 33, 99, 297.
Sum: 480.
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 297
The number 297 has 8 divisors:
1, 3, 9, 11, 27, 33, 99, 297
Divisor Pairs of 297
Each pair multiplies to 297:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 297 | = | 297 |
| 3 | × | 99 | = | 297 |
| 9 | × | 33 | = | 297 |
| 11 | × | 27 | = | 297 |
Number of Divisors
The number 297 has 8 divisors, written as τ(297) = 8 in number theory.
Sum of Divisors
σ(297) = 1 + 3 + 9 + 11 + 27 + 33 + 99 + 297 = 480
Prime Factorization of 297
Properties of 297
- 297 is composite.
- 297 is not a perfect square.
- Number of divisors: 8.
- Sum of divisors: 480.
Common Divisors with Another Number?
Looking for the divisors that 297 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 297
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √297 ≈ 17.23. If i divides 297, then both i and 297/i are divisors.
- 1 divides 297 (297 ÷ 1 = 297) → pair (1, 297)
- 3 divides 297 (297 ÷ 3 = 99) → pair (3, 99)
- 9 divides 297 (297 ÷ 9 = 33) → pair (9, 33)
- 11 divides 297 (297 ÷ 11 = 27) → pair (11, 27)
- Collect all unique values: {1, 3, 9, 11, 27, 33, 99, 297} — total 8 divisors.
- Sum: 1 + 3 + 9 + 11 + 27 + 33 + 99 + 297 = 480.
Nearby Examples
Related Operations for 297
- Multiples of 297 — "outward" complement; M is a multiple of 297 ⇔ 297 is a divisor of M
- 297 Prime Factorization — decompose into prime building blocks
- Find GCF of 297 and another number
- Find LCM of 297 and another number
- Is 297 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