Perfect, Abundant & Deficient Number Classifier

Introduction

Number theory often becomes clearer when you stop looking only at a number itself and start looking at the structure around it. The divisors of a positive integer tell you how that number can be built from smaller whole numbers, and the sum of those smaller divisors reveals a surprisingly rich pattern. This calculator uses that idea to sort integers into three classic groups: perfect, abundant, and deficient. The classification comes from comparing the number n with the sum of its proper divisors, written s(n).

A proper divisor is any positive divisor of n except n itself. For 12, the proper divisors are 1, 2, 3, 4, and 6. Their sum is 16, which is larger than 12, so 12 is abundant. For 28, the proper divisors are 1, 2, 4, 7, and 14. Their sum is exactly 28, so 28 is perfect. For a prime such as 97, the only proper divisor is 1, so the sum is much smaller than the number and the classification is deficient. Once you see a few examples, the idea becomes very intuitive: the divisor sum either falls short, lands exactly on target, or overshoots.

This page is designed both for quick checks and for learning. The result area makes the arithmetic visible, not hidden. If you are studying factors, practicing proofs, or debugging code that loops through divisors, the listed divisors give you a direct way to confirm what happened. If you are teaching or learning the topic, the explanations below show how to read the output, what assumptions the calculator makes, and why the comparison works.

How to use this classifier

Using the calculator is simple, but a few habits make the results more meaningful. Start by entering a whole number between 1 and 100,000. The page is intended for positive integers only, because the standard perfect/abundant/deficient definitions use positive divisors. The default value of 28 is a good first test because it is one of the smallest perfect numbers.

1. Type a positive integer into the input field.
2. Leave Show All Divisors checked if you want to see the proper divisors listed explicitly.
3. Select Classify Number to compute the aliquot sum.
4. Read the result from top to bottom: first the classification, then the divisor list, then the sum, difference, and index.

If you want to verify the answer by hand, list the factor pairs of the number. For instance, 36 has the factor pairs 1×36, 2×18, 3×12, 4×9, and 6×6. Excluding 36 itself leaves the proper divisors 1, 2, 3, 4, 6, 9, 12, and 18. Adding those values gives 55, which is greater than 36, so 36 is abundant. The calculator follows the same idea in code, only faster and with less chance of accidentally skipping a divisor.

A useful habit is to compare neighboring inputs. Enter 29 and then 30, or 15 and then 16. You will see that divisor sums can change sharply when a number gains several small factors. That contrast is one of the easiest ways to understand why primes and prime powers often look deficient while numbers with many small divisors are often abundant.

Formula and interpretation

The core quantity on this page is the aliquot sum. It is the sum of every positive divisor d of n with d < n. In symbols:

Once the sum is known, the classification is immediate. If s(n) = n, the number is perfect. If s(n) > n, the number is abundant. If s(n) < n, the number is deficient. The result panel also reports two extra measurements that help with interpretation. The first is the signed difference s(n) − n, which tells you how far away the number is from being perfect. The second is the abundance index s(n) / n, which is a size-adjusted ratio. A difference of 4 is large relative to 12, but tiny relative to 10,000; the ratio makes that comparison easier.

• Proper divisors: the exact values used in the sum.
• Divisor count: how many proper divisors were found.
• Divisor sum: the aliquot sum s(n).
• Difference: the signed quantity s(n) − n.
• Abundance index: the ratio s(n)/n.

This is closely related to the divisor-sum function σ(n), which adds all positive divisors, including the number itself. The two functions are connected by the identity s(n) = σ(n) − n. Some textbooks and websites discuss abundance with σ(n)/n; this calculator intentionally shows s(n)/n because it matches the proper-divisor comparison used in the classification itself. The page limits the input to 1 through 100,000 so the browser stays responsive while using straightforward trial division, which is easy to understand and accurate for this range.

Worked examples, patterns, and reference values

A short worked example usually makes the rule stick. Take n = 12. The proper divisors are 1, 2, 3, 4, and 6. Their sum is 16. Because 16 is greater than 12, 12 is abundant. The signed difference is 16 − 12 = 4, and the abundance index is 16/12 ≈ 1.3333. Now compare that with n = 28. Its proper divisors are 1, 2, 4, 7, and 14, which sum to 28 exactly, so 28 is perfect. The difference is zero, and the abundance index is exactly 1.0000.

Another useful example is n = 36. The proper divisors are 1, 2, 3, 4, 6, 9, 12, and 18. Their sum is 55, so the number is abundant by 19. This example is helpful because it shows why numbers with many small factors can become abundant quickly. By contrast, a prime such as 97 has only one proper divisor, namely 1. That means s(97) = 1, so the number is deficient by 96. If the calculator ever tells you a prime is abundant or perfect, something has gone wrong.

Several broad patterns are worth testing with the input box. First, primes are always deficient because their only proper divisor is 1. Second, powers of a prime are often deficient as well. For example, 16 has proper divisors 1, 2, 4, and 8, which sum to 15, so it misses perfection by exactly 1. Third, many even composites with several small factors are abundant because the divisor list grows quickly and the sum rises fast. Finally, perfect numbers are rare. Small examples include 6, 28, 496, and 8128, and they stand out because the divisor structure balances with unusual precision.

The table above makes a good study sheet because it includes a little of everything: the edge case of 1, a prime-like deficient pattern, abundant composites, and known perfect numbers. One especially useful comparison is 29 versus 30. The first is prime and therefore very deficient, while the second has many small factors and becomes abundant immediately. That side-by-side contrast shows how strongly divisor structure matters.

Interpretation, assumptions, and common questions

What happens for 1? The number 1 has no proper divisors, so its aliquot sum is 0. Since 0 is less than 1, the correct classification is deficient. This is a common first check because it forces you to remember that proper divisors exclude the number itself and that 1 does not have any smaller positive divisors.

Why show proper divisors instead of all divisors? The perfect/abundant/deficient definitions depend on proper divisors. If you include the number itself, the sum is automatically at least n, which hides the comparison the classifier is supposed to make. By reporting proper divisors, the page stays aligned with the standard number-theory definition and makes the difference s(n) − n meaningful.

How can you verify a result by hand? A reliable manual method is to search for factor pairs. If 20 is divisible by 2, then 10 is a partner divisor. If it is divisible by 4, then 5 is another partner divisor. Keep listing factor pairs until the trial divisor passes the square root of the number, then collect the distinct proper divisors and add them. The only special caution comes with perfect squares, where the square root pairs with itself and should be counted once, not twice.

What does the abundance index mean? On this page it is the ratio s(n)/n. A value greater than 1 indicates abundance, a value equal to 1 indicates perfection, and a value below 1 indicates deficiency. Ratios help when you compare numbers of different sizes. For example, 12 has an abundance index of about 1.3333, which tells you its proper divisors total one-third more than the number itself. A larger number could have a bigger raw difference but a smaller ratio, so the index is often the cleaner way to compare relative behavior.

Are odd perfect numbers known? No odd perfect number has ever been found, and mathematicians still do not know whether one exists. All currently known perfect numbers are even. That topic goes far beyond the needs of this calculator, but it helps explain why perfect numbers are treated as special landmarks rather than ordinary values you see all the time.

What assumptions does the calculator make? It accepts positive integers only and is intended for values from 1 to 100,000. The script uses direct trial division rather than advanced factorization formulas because the goal of this page is clarity and reliability for ordinary inputs, not research-scale performance on enormous integers. If you need to work with much larger values, a faster factorization-based method would be more appropriate, but the interpretation of the result would stay exactly the same.

Where is this useful in practice? For students, divisor sums are excellent practice for factorization, proof writing, and distinguishing between related functions such as s(n) and σ(n). For programmers, the topic appears in coding challenges, divisor-enumeration tasks, and performance discussions about looping only to the square root instead of testing every smaller integer. The ideas also lead naturally into related topics such as amicable numbers, where the aliquot sum of one number equals the other and vice versa. Even if you never pursue those deeper topics, this classifier is a compact way to build intuition about how factors shape arithmetic structure.

If you want a good set of test values, try a mix: primes like 2, 3, 5, 7, and 11; prime powers like 8, 16, 27, and 32; dense composites like 12, 18, 20, 24, 30, and 36; and known perfect numbers such as 6, 28, and 496. Watching how the divisor list changes from one category to the next is often more informative than memorizing the labels alone.

About this calculator. The results are computed locally in your browser. If you are using the output in class notes, homework, or programming documentation, include the divisor list and the aliquot sum so your reasoning is transparent and easy to verify.

Accessibility note. The results section updates dynamically after you submit the form, and it is marked as a live region so assistive technologies can announce changes. The mini-game is optional and separate from the calculator itself; the math above remains complete even if you skip it.