Plan your future with our Retirement Budget Calculator

Sum of Divisors Calculator

Enter a positive integer to calculate the sum of all its divisors, the sum of proper divisors, abundance ratio, and whether the number is perfect, abundant, or deficient.
Loading...
Luis GonzalezCreated by Luis GonzalezLast updated:

How to Use This Calculator

  1. 1

    Enter a Positive Integer

    Input any positive whole number into the field. This is the number for which you want to find the sum of its divisors.

  2. 2

    View the Sum of All Divisors

    The calculator will display the total sum of all divisors, including 1 and the number itself.

  3. 3

    Check the Number's Classification

    Instantly see if the number is 'perfect,' 'abundant,' or 'deficient' based on the relationship between its sum of proper divisors and the number itself.

Example Calculation

A student of number theory wants to classify the number 28 by finding the sum of its divisors.

Number

28

Results

56

Tips

Prime Numbers Are Deficient

Every prime number is by definition a deficient number because its only proper divisor is 1, so the sum of its proper divisors is always less than the number itself.

Perfect Numbers Are Rare

Perfect numbers (where the sum of proper divisors equals the number itself) are very rare. The first four are 6, 28, 496, and 8128. They are all even, and it's unknown if any odd perfect numbers exist.

Abundant Numbers are Common

Abundant numbers are quite common. The smallest abundant number is 12. If a number is a multiple of an abundant number, it is also abundant (e.g., multiples of 12 like 24, 36, 48 are abundant).

The Sum of Divisors Calculator helps you explore fundamental properties of integers by computing the sum of all their positive divisors. This tool not only provides the total sum but also classifies the number as perfect, abundant, or deficient, offering insights into its numerical characteristics. For students and enthusiasts of number theory, understanding the sum of divisors is key to appreciating ancient mathematical concepts and modern cryptographic principles.

The Formula for Summing Divisors

To find the sum of divisors for any integer, the most efficient method involves its prime factorization. If a number n can be expressed as a product of its prime factors p1^a1 × p2^a2 × ... × pk^ak, then the sum of its divisors, denoted as σ(n), can be calculated using the formula:

σ(n) = (1 + p1 + p1^2 + ... + p1^a1) × ... × (1 + pk + pk^2 + ... + pk^ak)

This simplifies to:

σ(n) = ((p1^(a1+1) - 1) / (p1 - 1)) × ... × ((pk^(ak+1) - 1) / (pk - 1))

For example, for the number 28, its prime factorization is 2^2 × 7^1. Here, p1 = 2, a1 = 2, p2 = 7, a2 = 1. Thus, the sum of divisors is ((2^(2+1) - 1) / (2 - 1)) × ((7^(1+1) - 1) / (7 - 1)) = ((2^3 - 1) / 1) × ((7^2 - 1) / 6) = (8 - 1) × (49 - 1) / 6 = 7 × 48 / 6 = 7 × 8 = 56.

💡 Just as we sum divisors, basic arithmetic operations are foundational to all math. Our Subtracting Mixed Numbers Calculator helps master more complex subtraction problems.

Classifying the Number 28: A Worked Example

Let's determine the sum of divisors and classify the number 28 using the calculator's logic.

  1. Identify the number: We are analyzing the integer 28.
  2. Find all divisors: The positive divisors of 28 are 1, 2, 4, 7, 14, and 28.
  3. Calculate the sum of all divisors: 1 + 2 + 4 + 7 + 14 + 28 = 56.
  4. Identify proper divisors: These are all divisors excluding 28 itself: 1, 2, 4, 7, 14.
  5. Calculate the sum of proper divisors: 1 + 2 + 4 + 7 + 14 = 28.
  6. Classify the number: Since the sum of its proper divisors (28) is equal to the number itself (28), 28 is classified as a perfect number.

This example confirms that 28 is indeed the second known perfect number, a fact that has fascinated mathematicians for millennia.

💡 For other fundamental arithmetic explorations, such as comparing multiple values, our Sugar Intake Limit Calculator applies similar comparison logic to health guidelines.

Standard Classifications in Number Theory

The classification of numbers as perfect, abundant, or deficient is a standard concept in number theory, dating back to ancient Greek mathematicians like Euclid and Nicomachus. These classifications are based on the relationship between a number and the sum of its proper divisors (all positive divisors excluding the number itself). A number n is defined as:

  • Perfect if the sum of its proper divisors equals n. Examples include 6 (1+2+3=6) and 28 (1+2+4+7+14=28).
  • Abundant if the sum of its proper divisors is greater than n. The smallest abundant number is 12 (1+2+3+4+6=16 > 12).
  • Deficient if the sum of its proper divisors is less than n. All prime numbers, and powers of prime numbers, are deficient. For example, 5 is deficient (1 < 5). These precise definitions form a fundamental part of elementary number theory, providing a structured way to categorize integers based on their intrinsic properties.

The Historical Significance of Divisors

The study of divisors and their sums has a rich historical context, extending back to the ancient Greeks. Philosophers and mathematicians, including Pythagoras and Euclid, were captivated by the properties of numbers, particularly the concept of perfect numbers. They believed these numbers held mystical or spiritual significance, with 6 and 28 being seen as particularly harmonious. Euclid, in his Elements (Book IX, Proposition 36), provided a formula for generating even perfect numbers, which remains foundational. Later, Islamic mathematicians continued the study, and in the Renaissance, European scholars like Marin Mersenne contributed to the search for larger perfect numbers, linking them to Mersenne primes. This historical fascination underscores that the sum of divisors is not merely a mathematical curiosity but a concept that has driven mathematical inquiry and shaped our understanding of number theory for over two millennia.

Frequently Asked Questions

What is the sum of divisors?

The sum of divisors of a positive integer is the total obtained by adding up all its positive divisors, including 1 and the number itself. For example, the divisors of 6 are 1, 2, 3, and 6, so their sum is 1 + 2 + 3 + 6 = 12. This function is often denoted by σ(n) or sum(n).

How are numbers classified based on their divisors?

Numbers are classified as perfect, abundant, or deficient based on the sum of their *proper* divisors (divisors excluding the number itself). A number is perfect if the sum of its proper divisors equals the number. It's abundant if the sum is greater than the number, and deficient if the sum is less than the number. For instance, 6 is perfect (1+2+3=6), 12 is abundant (1+2+3+4+6=16 > 12), and 5 is deficient (1 < 5).

What is a proper divisor?

A proper divisor of a positive integer is any positive divisor of that number, excluding the number itself. For example, the divisors of 10 are 1, 2, 5, and 10. The proper divisors of 10 are 1, 2, and 5. The sum of proper divisors is a key metric for classifying numbers in number theory.

Why is the sum of divisors concept important in mathematics?

The sum of divisors function is a fundamental concept in number theory, crucial for classifying numbers into categories like perfect, abundant, and deficient. It plays a significant role in the study of arithmetic functions, prime factorization, and in exploring relationships between integers. Historically, the classification of numbers by their divisors has fascinated mathematicians since ancient Greece.