Divisors of 4851: All 18 Factors

Quick Answer

4851 has 18 divisors (factors): 1, 3, 7, 9, 11, 21, 33, 49, 63, 77, 99, 147, 231, 441, 539, 693, 1617, 4851.

Sum: 8892.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
18 divisors
1, 3, 7, 9, 11, 21, 33, 49, 63, 77, 99, 147, 231, 441, 539, 693, 1617, 4851

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 4851

The number 4851 has 18 divisors:

1,  3,  7,  9,  11,  21,  33,  49,  63,  77,  99,  147,  231,  441,  539,  693,  1617,  4851

Divisor Pairs of 4851

Each pair multiplies to 4851:

Factor 1×Factor 2=Product
1×4851=4851
3×1617=4851
7×693=4851
9×539=4851
11×441=4851
21×231=4851
33×147=4851
49×99=4851
63×77=4851

Number of Divisors

The number 4851 has 18 divisors, written as τ(4851) = 18 in number theory.

Sum of Divisors

σ(4851) = 1 + 3 + 7 + 9 + 11 + 21 + 33 + 49 + 63 + 77 + 99 + 147 + 231 + 441 + 539 + 693 + 1617 + 4851 = 8892

Properties of 4851

  • 4851 is composite.
  • 4851 is not a perfect square.
  • Number of divisors: 18.
  • Sum of divisors: 8892.

Common Divisors with Another Number?

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

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

  1. 1 divides 4851 (4851 ÷ 1 = 4851) → pair (1, 4851)
  2. 3 divides 4851 (4851 ÷ 3 = 1617) → pair (3, 1617)
  3. 7 divides 4851 (4851 ÷ 7 = 693) → pair (7, 693)
  4. 9 divides 4851 (4851 ÷ 9 = 539) → pair (9, 539)
  5. 11 divides 4851 (4851 ÷ 11 = 441) → pair (11, 441)
  6. 21 divides 4851 (4851 ÷ 21 = 231) → pair (21, 231)
  7. 33 divides 4851 (4851 ÷ 33 = 147) → pair (33, 147)
  8. 49 divides 4851 (4851 ÷ 49 = 99) → pair (49, 99)
  9. 63 divides 4851 (4851 ÷ 63 = 77) → pair (63, 77)
  10. Collect all unique values: {1, 3, 7, 9, 11, 21, 33, 49, 63, 77, 99, 147, 231, 441, 539, 693, 1617, 4851} — total 18 divisors.
  11. Sum: 1 + 3 + 7 + 9 + 11 + 21 + 33 + 49 + 63 + 77 + 99 + 147 + 231 + 441 + 539 + 693 + 1617 + 4851 = 8892.

Nearby Examples

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

Related Operations for 4851

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