Divisors of 68096: All 40 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 68096

The number 68096 has 40 divisors:

1,  2,  4,  7,  8,  14,  16,  19,  28,  32,  38,  56,  64,  76,  112,  128,  133,  152,  224,  256,  266,  304,  448,  512,  532,  608,  896,  1064,  1216,  1792,  2128,  2432,  3584,  4256,  4864,  8512,  9728,  17024,  34048,  68096

Divisor Pairs of 68096

Each pair multiplies to 68096:

Number of Divisors

The number 68096 has 40 divisors, written as τ(68096) = 40 in number theory.

Sum of Divisors

σ(68096) = 1 + 2 + 4 + 7 + 8 + 14 + 16 + 19 + 28 + 32 + 38 + 56 + 64 + 76 + 112 + 128 + 133 + 152 + 224 + 256 + 266 + 304 + 448 + 512 + 532 + 608 + 896 + 1064 + 1216 + 1792 + 2128 + 2432 + 3584 + 4256 + 4864 + 8512 + 9728 + 17024 + 34048 + 68096 = 163680

Prime Factorization of 68096

See the full prime factorization calculator →

Properties of 68096

• 68096 is composite.
• 68096 is not a perfect square.
• Number of divisors: 40.
• Sum of divisors: 163680.

Common Divisors with Another Number?

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

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

1. 1 divides 68096 (68096 ÷ 1 = 68096) → pair (1, 68096)
2. 2 divides 68096 (68096 ÷ 2 = 34048) → pair (2, 34048)
3. 4 divides 68096 (68096 ÷ 4 = 17024) → pair (4, 17024)
4. 7 divides 68096 (68096 ÷ 7 = 9728) → pair (7, 9728)
5. 8 divides 68096 (68096 ÷ 8 = 8512) → pair (8, 8512)
6. 14 divides 68096 (68096 ÷ 14 = 4864) → pair (14, 4864)
7. 16 divides 68096 (68096 ÷ 16 = 4256) → pair (16, 4256)
8. 19 divides 68096 (68096 ÷ 19 = 3584) → pair (19, 3584)
9. 28 divides 68096 (68096 ÷ 28 = 2432) → pair (28, 2432)
10. 32 divides 68096 (68096 ÷ 32 = 2128) → pair (32, 2128)
11. 38 divides 68096 (68096 ÷ 38 = 1792) → pair (38, 1792)
12. 56 divides 68096 (68096 ÷ 56 = 1216) → pair (56, 1216)
13. 64 divides 68096 (68096 ÷ 64 = 1064) → pair (64, 1064)
14. 76 divides 68096 (68096 ÷ 76 = 896) → pair (76, 896)
15. 112 divides 68096 (68096 ÷ 112 = 608) → pair (112, 608)
16. 128 divides 68096 (68096 ÷ 128 = 532) → pair (128, 532)
17. 133 divides 68096 (68096 ÷ 133 = 512) → pair (133, 512)
18. 152 divides 68096 (68096 ÷ 152 = 448) → pair (152, 448)
19. 224 divides 68096 (68096 ÷ 224 = 304) → pair (224, 304)
20. 256 divides 68096 (68096 ÷ 256 = 266) → pair (256, 266)
21. Collect all unique values: {1, 2, 4, 7, 8, 14, 16, 19, 28, 32, 38, 56, 64, 76, 112, 128, 133, 152, 224, 256, 266, 304, 448, 512, 532, 608, 896, 1064, 1216, 1792, 2128, 2432, 3584, 4256, 4864, 8512, 9728, 17024, 34048, 68096} — total 40 divisors.
22. Sum: 1 + 2 + 4 + 7 + 8 + 14 + 16 + 19 + 28 + 32 + 38 + 56 + 64 + 76 + 112 + 128 + 133 + 152 + 224 + 256 + 266 + 304 + 448 + 512 + 532 + 608 + 896 + 1064 + 1216 + 1792 + 2128 + 2432 + 3584 + 4256 + 4864 + 8512 + 9728 + 17024 + 34048 + 68096 = 163680.

Nearby Examples

Related Operations for 68096

• Multiples of a Number — "outward" complement of divisors
• 68096 Prime Factorization — decompose into prime building blocks
• Find GCF of 68096 and another number
• Find LCM of 68096 and another number
• Is 68096 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: