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