Divisors of 55168: All 16 Factors

Quick Answer

55168 has 16 divisors (factors): 1, 2, 4, 8, 16, 32, 64, 128, 431, 862, 1724, 3448, 6896, 13792, 27584, 55168.

Sum: 110160.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
16 divisors
1, 2, 4, 8, 16, 32, 64, 128, 431, 862, 1724, 3448, 6896, 13792, 27584, 55168

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 55168

The number 55168 has 16 divisors:

1,  2,  4,  8,  16,  32,  64,  128,  431,  862,  1724,  3448,  6896,  13792,  27584,  55168

Divisor Pairs of 55168

Each pair multiplies to 55168:

Factor 1×Factor 2=Product
1×55168=55168
2×27584=55168
4×13792=55168
8×6896=55168
16×3448=55168
32×1724=55168
64×862=55168
128×431=55168

Number of Divisors

The number 55168 has 16 divisors, written as τ(55168) = 16 in number theory.

Sum of Divisors

σ(55168) = 1 + 2 + 4 + 8 + 16 + 32 + 64 + 128 + 431 + 862 + 1724 + 3448 + 6896 + 13792 + 27584 + 55168 = 110160

Properties of 55168

  • 55168 is composite.
  • 55168 is not a perfect square.
  • Number of divisors: 16.
  • Sum of divisors: 110160.

Common Divisors with Another Number?

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

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

  1. 1 divides 55168 (55168 ÷ 1 = 55168) → pair (1, 55168)
  2. 2 divides 55168 (55168 ÷ 2 = 27584) → pair (2, 27584)
  3. 4 divides 55168 (55168 ÷ 4 = 13792) → pair (4, 13792)
  4. 8 divides 55168 (55168 ÷ 8 = 6896) → pair (8, 6896)
  5. 16 divides 55168 (55168 ÷ 16 = 3448) → pair (16, 3448)
  6. 32 divides 55168 (55168 ÷ 32 = 1724) → pair (32, 1724)
  7. 64 divides 55168 (55168 ÷ 64 = 862) → pair (64, 862)
  8. 128 divides 55168 (55168 ÷ 128 = 431) → pair (128, 431)
  9. Collect all unique values: {1, 2, 4, 8, 16, 32, 64, 128, 431, 862, 1724, 3448, 6896, 13792, 27584, 55168} — total 16 divisors.
  10. Sum: 1 + 2 + 4 + 8 + 16 + 32 + 64 + 128 + 431 + 862 + 1724 + 3448 + 6896 + 13792 + 27584 + 55168 = 110160.

Nearby Examples

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

Related Operations for 55168

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