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