Divisors of 9396: All 30 Factors
Quick Answer
9396 has 30 divisors (factors): 1, 2, 3, 4, 6, 9, 12, 18, 27, 29, 36, 54, 58, 81, 87, 108, 116, 162, 174, 261, 324, 348, 522, 783, 1044, 1566, 2349, 3132, 4698, 9396.
Sum: 25410.
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 9396
The number 9396 has 30 divisors:
1, 2, 3, 4, 6, 9, 12, 18, 27, 29, 36, 54, 58, 81, 87, 108, 116, 162, 174, 261, 324, 348, 522, 783, 1044, 1566, 2349, 3132, 4698, 9396
Divisor Pairs of 9396
Each pair multiplies to 9396:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 9396 | = | 9396 |
| 2 | × | 4698 | = | 9396 |
| 3 | × | 3132 | = | 9396 |
| 4 | × | 2349 | = | 9396 |
| 6 | × | 1566 | = | 9396 |
| 9 | × | 1044 | = | 9396 |
| 12 | × | 783 | = | 9396 |
| 18 | × | 522 | = | 9396 |
| 27 | × | 348 | = | 9396 |
| 29 | × | 324 | = | 9396 |
| 36 | × | 261 | = | 9396 |
| 54 | × | 174 | = | 9396 |
| 58 | × | 162 | = | 9396 |
| 81 | × | 116 | = | 9396 |
| 87 | × | 108 | = | 9396 |
Number of Divisors
The number 9396 has 30 divisors, written as τ(9396) = 30 in number theory.
Sum of Divisors
σ(9396) = 1 + 2 + 3 + 4 + 6 + 9 + 12 + 18 + 27 + 29 + 36 + 54 + 58 + 81 + 87 + 108 + 116 + 162 + 174 + 261 + 324 + 348 + 522 + 783 + 1044 + 1566 + 2349 + 3132 + 4698 + 9396 = 25410
Prime Factorization of 9396
Properties of 9396
- 9396 is composite.
- 9396 is not a perfect square.
- Number of divisors: 30.
- Sum of divisors: 25410.
Common Divisors with Another Number?
Looking for the divisors that 9396 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 9396
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √9396 ≈ 96.93. If i divides 9396, then both i and 9396/i are divisors.
- 1 divides 9396 (9396 ÷ 1 = 9396) → pair (1, 9396)
- 2 divides 9396 (9396 ÷ 2 = 4698) → pair (2, 4698)
- 3 divides 9396 (9396 ÷ 3 = 3132) → pair (3, 3132)
- 4 divides 9396 (9396 ÷ 4 = 2349) → pair (4, 2349)
- 6 divides 9396 (9396 ÷ 6 = 1566) → pair (6, 1566)
- 9 divides 9396 (9396 ÷ 9 = 1044) → pair (9, 1044)
- 12 divides 9396 (9396 ÷ 12 = 783) → pair (12, 783)
- 18 divides 9396 (9396 ÷ 18 = 522) → pair (18, 522)
- 27 divides 9396 (9396 ÷ 27 = 348) → pair (27, 348)
- 29 divides 9396 (9396 ÷ 29 = 324) → pair (29, 324)
- 36 divides 9396 (9396 ÷ 36 = 261) → pair (36, 261)
- 54 divides 9396 (9396 ÷ 54 = 174) → pair (54, 174)
- 58 divides 9396 (9396 ÷ 58 = 162) → pair (58, 162)
- 81 divides 9396 (9396 ÷ 81 = 116) → pair (81, 116)
- 87 divides 9396 (9396 ÷ 87 = 108) → pair (87, 108)
- Collect all unique values: {1, 2, 3, 4, 6, 9, 12, 18, 27, 29, 36, 54, 58, 81, 87, 108, 116, 162, 174, 261, 324, 348, 522, 783, 1044, 1566, 2349, 3132, 4698, 9396} — total 30 divisors.
- Sum: 1 + 2 + 3 + 4 + 6 + 9 + 12 + 18 + 27 + 29 + 36 + 54 + 58 + 81 + 87 + 108 + 116 + 162 + 174 + 261 + 324 + 348 + 522 + 783 + 1044 + 1566 + 2349 + 3132 + 4698 + 9396 = 25410.
Nearby Examples
Related Operations for 9396
- Multiples of 9396 — "outward" complement; M is a multiple of 9396 ⇔ 9396 is a divisor of M
- 9396 Prime Factorization — decompose into prime building blocks
- Find GCF of 9396 and another number
- Find LCM of 9396 and another number
- Is 9396 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