Divisors of 1095: All 8 Factors

Quick Answer

1095 has 8 divisors (factors): 1, 3, 5, 15, 73, 219, 365, 1095.

Sum: 1776.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
8 divisors
1, 3, 5, 15, 73, 219, 365, 1095

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 1095

The number 1095 has 8 divisors:

1,  3,  5,  15,  73,  219,  365,  1095

Divisor Pairs of 1095

Each pair multiplies to 1095:

Factor 1×Factor 2=Product
1×1095=1095
3×365=1095
5×219=1095
15×73=1095

Number of Divisors

The number 1095 has 8 divisors, written as τ(1095) = 8 in number theory.

Sum of Divisors

σ(1095) = 1 + 3 + 5 + 15 + 73 + 219 + 365 + 1095 = 1776

Properties of 1095

  • 1095 is composite.
  • 1095 is not a perfect square.
  • Number of divisors: 8.
  • Sum of divisors: 1776.

Common Divisors with Another Number?

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

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

  1. 1 divides 1095 (1095 ÷ 1 = 1095) → pair (1, 1095)
  2. 3 divides 1095 (1095 ÷ 3 = 365) → pair (3, 365)
  3. 5 divides 1095 (1095 ÷ 5 = 219) → pair (5, 219)
  4. 15 divides 1095 (1095 ÷ 15 = 73) → pair (15, 73)
  5. Collect all unique values: {1, 3, 5, 15, 73, 219, 365, 1095} — total 8 divisors.
  6. Sum: 1 + 3 + 5 + 15 + 73 + 219 + 365 + 1095 = 1776.

Nearby Examples

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

Related Operations for 1095

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