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