Divisors of 74496: All 36 Factors

Quick Answer

74496 has 36 divisors (factors): 1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 97, 128, 192, 194, 256, 291, 384, 388, 582, 768, 776, 1164, 1552, 2328, 3104, 4656, 6208, 9312, 12416, 18624, 24832, 37248, 74496.

Sum: 200312.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
36 divisors
1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 97, 128, 192, 194, 256, 291, 384, 388, 582, 768, 776, 1164, 1552, 2328, 3104, 4656, 6208, 9312, 12416, 18624, 24832, 37248, 74496

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 74496

The number 74496 has 36 divisors:

1,  2,  3,  4,  6,  8,  12,  16,  24,  32,  48,  64,  96,  97,  128,  192,  194,  256,  291,  384,  388,  582,  768,  776,  1164,  1552,  2328,  3104,  4656,  6208,  9312,  12416,  18624,  24832,  37248,  74496

Divisor Pairs of 74496

Each pair multiplies to 74496:

Factor 1×Factor 2=Product
1×74496=74496
2×37248=74496
3×24832=74496
4×18624=74496
6×12416=74496
8×9312=74496
12×6208=74496
16×4656=74496
24×3104=74496
32×2328=74496
48×1552=74496
64×1164=74496
96×776=74496
97×768=74496
128×582=74496
192×388=74496
194×384=74496
256×291=74496

Number of Divisors

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

Sum of Divisors

σ(74496) = 1 + 2 + 3 + 4 + 6 + 8 + 12 + 16 + 24 + 32 + 48 + 64 + 96 + 97 + 128 + 192 + 194 + 256 + 291 + 384 + 388 + 582 + 768 + 776 + 1164 + 1552 + 2328 + 3104 + 4656 + 6208 + 9312 + 12416 + 18624 + 24832 + 37248 + 74496 = 200312

Properties of 74496

  • 74496 is composite.
  • 74496 is not a perfect square.
  • Number of divisors: 36.
  • Sum of divisors: 200312.

Common Divisors with Another Number?

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

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

  1. 1 divides 74496 (74496 ÷ 1 = 74496) → pair (1, 74496)
  2. 2 divides 74496 (74496 ÷ 2 = 37248) → pair (2, 37248)
  3. 3 divides 74496 (74496 ÷ 3 = 24832) → pair (3, 24832)
  4. 4 divides 74496 (74496 ÷ 4 = 18624) → pair (4, 18624)
  5. 6 divides 74496 (74496 ÷ 6 = 12416) → pair (6, 12416)
  6. 8 divides 74496 (74496 ÷ 8 = 9312) → pair (8, 9312)
  7. 12 divides 74496 (74496 ÷ 12 = 6208) → pair (12, 6208)
  8. 16 divides 74496 (74496 ÷ 16 = 4656) → pair (16, 4656)
  9. 24 divides 74496 (74496 ÷ 24 = 3104) → pair (24, 3104)
  10. 32 divides 74496 (74496 ÷ 32 = 2328) → pair (32, 2328)
  11. 48 divides 74496 (74496 ÷ 48 = 1552) → pair (48, 1552)
  12. 64 divides 74496 (74496 ÷ 64 = 1164) → pair (64, 1164)
  13. 96 divides 74496 (74496 ÷ 96 = 776) → pair (96, 776)
  14. 97 divides 74496 (74496 ÷ 97 = 768) → pair (97, 768)
  15. 128 divides 74496 (74496 ÷ 128 = 582) → pair (128, 582)
  16. 192 divides 74496 (74496 ÷ 192 = 388) → pair (192, 388)
  17. 194 divides 74496 (74496 ÷ 194 = 384) → pair (194, 384)
  18. 256 divides 74496 (74496 ÷ 256 = 291) → pair (256, 291)
  19. Collect all unique values: {1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 97, 128, 192, 194, 256, 291, 384, 388, 582, 768, 776, 1164, 1552, 2328, 3104, 4656, 6208, 9312, 12416, 18624, 24832, 37248, 74496} — total 36 divisors.
  20. Sum: 1 + 2 + 3 + 4 + 6 + 8 + 12 + 16 + 24 + 32 + 48 + 64 + 96 + 97 + 128 + 192 + 194 + 256 + 291 + 384 + 388 + 582 + 768 + 776 + 1164 + 1552 + 2328 + 3104 + 4656 + 6208 + 9312 + 12416 + 18624 + 24832 + 37248 + 74496 = 200312.

Nearby Examples

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

Related Operations for 74496

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