Divisors of 76832: All 30 Factors

Quick Answer

76832 has 30 divisors (factors): 1, 2, 4, 7, 8, 14, 16, 28, 32, 49, 56, 98, 112, 196, 224, 343, 392, 686, 784, 1372, 1568, 2401, 2744, 4802, 5488, 9604, 10976, 19208, 38416, 76832.

Sum: 176463.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
30 divisors
1, 2, 4, 7, 8, 14, 16, 28, 32, 49, 56, 98, 112, 196, 224, 343, 392, 686, 784, 1372, 1568, 2401, 2744, 4802, 5488, 9604, 10976, 19208, 38416, 76832

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 76832

The number 76832 has 30 divisors:

1,  2,  4,  7,  8,  14,  16,  28,  32,  49,  56,  98,  112,  196,  224,  343,  392,  686,  784,  1372,  1568,  2401,  2744,  4802,  5488,  9604,  10976,  19208,  38416,  76832

Divisor Pairs of 76832

Each pair multiplies to 76832:

Factor 1×Factor 2=Product
1×76832=76832
2×38416=76832
4×19208=76832
7×10976=76832
8×9604=76832
14×5488=76832
16×4802=76832
28×2744=76832
32×2401=76832
49×1568=76832
56×1372=76832
98×784=76832
112×686=76832
196×392=76832
224×343=76832

Number of Divisors

The number 76832 has 30 divisors, written as τ(76832) = 30 in number theory.

Sum of Divisors

σ(76832) = 1 + 2 + 4 + 7 + 8 + 14 + 16 + 28 + 32 + 49 + 56 + 98 + 112 + 196 + 224 + 343 + 392 + 686 + 784 + 1372 + 1568 + 2401 + 2744 + 4802 + 5488 + 9604 + 10976 + 19208 + 38416 + 76832 = 176463

Properties of 76832

  • 76832 is composite.
  • 76832 is not a perfect square.
  • Number of divisors: 30.
  • Sum of divisors: 176463.

Common Divisors with Another Number?

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

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

  1. 1 divides 76832 (76832 ÷ 1 = 76832) → pair (1, 76832)
  2. 2 divides 76832 (76832 ÷ 2 = 38416) → pair (2, 38416)
  3. 4 divides 76832 (76832 ÷ 4 = 19208) → pair (4, 19208)
  4. 7 divides 76832 (76832 ÷ 7 = 10976) → pair (7, 10976)
  5. 8 divides 76832 (76832 ÷ 8 = 9604) → pair (8, 9604)
  6. 14 divides 76832 (76832 ÷ 14 = 5488) → pair (14, 5488)
  7. 16 divides 76832 (76832 ÷ 16 = 4802) → pair (16, 4802)
  8. 28 divides 76832 (76832 ÷ 28 = 2744) → pair (28, 2744)
  9. 32 divides 76832 (76832 ÷ 32 = 2401) → pair (32, 2401)
  10. 49 divides 76832 (76832 ÷ 49 = 1568) → pair (49, 1568)
  11. 56 divides 76832 (76832 ÷ 56 = 1372) → pair (56, 1372)
  12. 98 divides 76832 (76832 ÷ 98 = 784) → pair (98, 784)
  13. 112 divides 76832 (76832 ÷ 112 = 686) → pair (112, 686)
  14. 196 divides 76832 (76832 ÷ 196 = 392) → pair (196, 392)
  15. 224 divides 76832 (76832 ÷ 224 = 343) → pair (224, 343)
  16. Collect all unique values: {1, 2, 4, 7, 8, 14, 16, 28, 32, 49, 56, 98, 112, 196, 224, 343, 392, 686, 784, 1372, 1568, 2401, 2744, 4802, 5488, 9604, 10976, 19208, 38416, 76832} — total 30 divisors.
  17. Sum: 1 + 2 + 4 + 7 + 8 + 14 + 16 + 28 + 32 + 49 + 56 + 98 + 112 + 196 + 224 + 343 + 392 + 686 + 784 + 1372 + 1568 + 2401 + 2744 + 4802 + 5488 + 9604 + 10976 + 19208 + 38416 + 76832 = 176463.

Nearby Examples

ndivisors countsum σ(n)
360241170
24020744
18018546
14415403
12016360
1009217
9012234
8412224

Related Operations for 76832

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