Divisors of 730: All 8 Factors

Quick Answer

730 has 8 divisors (factors): 1, 2, 5, 10, 73, 146, 365, 730.

Sum: 1332.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
8 divisors
1, 2, 5, 10, 73, 146, 365, 730

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 730

The number 730 has 8 divisors:

1,  2,  5,  10,  73,  146,  365,  730

Divisor Pairs of 730

Each pair multiplies to 730:

Factor 1×Factor 2=Product
1×730=730
2×365=730
5×146=730
10×73=730

Number of Divisors

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

Sum of Divisors

σ(730) = 1 + 2 + 5 + 10 + 73 + 146 + 365 + 730 = 1332

Properties of 730

  • 730 is composite.
  • 730 is not a perfect square.
  • Number of divisors: 8.
  • Sum of divisors: 1332.

Common Divisors with Another Number?

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

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

  1. 1 divides 730 (730 ÷ 1 = 730) → pair (1, 730)
  2. 2 divides 730 (730 ÷ 2 = 365) → pair (2, 365)
  3. 5 divides 730 (730 ÷ 5 = 146) → pair (5, 146)
  4. 10 divides 730 (730 ÷ 10 = 73) → pair (10, 73)
  5. Collect all unique values: {1, 2, 5, 10, 73, 146, 365, 730} — total 8 divisors.
  6. Sum: 1 + 2 + 5 + 10 + 73 + 146 + 365 + 730 = 1332.

Nearby Examples

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

Related Operations for 730

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