Divisors of 26656: All 36 Factors

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 26656

The number 26656 has 36 divisors:

1,  2,  4,  7,  8,  14,  16,  17,  28,  32,  34,  49,  56,  68,  98,  112,  119,  136,  196,  224,  238,  272,  392,  476,  544,  784,  833,  952,  1568,  1666,  1904,  3332,  3808,  6664,  13328,  26656

Divisor Pairs of 26656

Each pair multiplies to 26656:

Number of Divisors

The number 26656 has 36 divisors, written as τ(26656) = 36 in number theory.

Sum of Divisors

σ(26656) = 1 + 2 + 4 + 7 + 8 + 14 + 16 + 17 + 28 + 32 + 34 + 49 + 56 + 68 + 98 + 112 + 119 + 136 + 196 + 224 + 238 + 272 + 392 + 476 + 544 + 784 + 833 + 952 + 1568 + 1666 + 1904 + 3332 + 3808 + 6664 + 13328 + 26656 = 64638

Prime Factorization of 26656

See the full prime factorization calculator →

Properties of 26656

• 26656 is composite.
• 26656 is not a perfect square.
• Number of divisors: 36.
• Sum of divisors: 64638.

Common Divisors with Another Number?

Looking for the divisors that 26656 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 26656

An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √26656 ≈ 163.27. If i divides 26656, then both i and 26656/i are divisors.

1. 1 divides 26656 (26656 ÷ 1 = 26656) → pair (1, 26656)
2. 2 divides 26656 (26656 ÷ 2 = 13328) → pair (2, 13328)
3. 4 divides 26656 (26656 ÷ 4 = 6664) → pair (4, 6664)
4. 7 divides 26656 (26656 ÷ 7 = 3808) → pair (7, 3808)
5. 8 divides 26656 (26656 ÷ 8 = 3332) → pair (8, 3332)
6. 14 divides 26656 (26656 ÷ 14 = 1904) → pair (14, 1904)
7. 16 divides 26656 (26656 ÷ 16 = 1666) → pair (16, 1666)
8. 17 divides 26656 (26656 ÷ 17 = 1568) → pair (17, 1568)
9. 28 divides 26656 (26656 ÷ 28 = 952) → pair (28, 952)
10. 32 divides 26656 (26656 ÷ 32 = 833) → pair (32, 833)
11. 34 divides 26656 (26656 ÷ 34 = 784) → pair (34, 784)
12. 49 divides 26656 (26656 ÷ 49 = 544) → pair (49, 544)
13. 56 divides 26656 (26656 ÷ 56 = 476) → pair (56, 476)
14. 68 divides 26656 (26656 ÷ 68 = 392) → pair (68, 392)
15. 98 divides 26656 (26656 ÷ 98 = 272) → pair (98, 272)
16. 112 divides 26656 (26656 ÷ 112 = 238) → pair (112, 238)
17. 119 divides 26656 (26656 ÷ 119 = 224) → pair (119, 224)
18. 136 divides 26656 (26656 ÷ 136 = 196) → pair (136, 196)
19. Collect all unique values: {1, 2, 4, 7, 8, 14, 16, 17, 28, 32, 34, 49, 56, 68, 98, 112, 119, 136, 196, 224, 238, 272, 392, 476, 544, 784, 833, 952, 1568, 1666, 1904, 3332, 3808, 6664, 13328, 26656} — total 36 divisors.
20. Sum: 1 + 2 + 4 + 7 + 8 + 14 + 16 + 17 + 28 + 32 + 34 + 49 + 56 + 68 + 98 + 112 + 119 + 136 + 196 + 224 + 238 + 272 + 392 + 476 + 544 + 784 + 833 + 952 + 1568 + 1666 + 1904 + 3332 + 3808 + 6664 + 13328 + 26656 = 64638.

Nearby Examples

Related Operations for 26656

• Multiples of a Number — "outward" complement of divisors
• 26656 Prime Factorization — decompose into prime building blocks
• Find GCF of 26656 and another number
• Find LCM of 26656 and another number
• Is 26656 a perfect square? (odd divisor count ⇔ yes)

See also our tables of divisors:

• Table of all divisors from 1 to 100
• Table of all divisors from 1 to 500
• Table of all divisors from 1 to 1,000
• Table of all divisors from 1 to 10,000

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.

References

• [1] Divisor (Wikipedia)
• [2] Divisor function (Wikipedia)
• [3] Divisor (Wolfram MathWorld)

Divisors Calculation Examples

Find all divisors of these numbers: