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