Perfect, Abundant & Deficient Number Classifier

Introduction to perfect, abundant, and deficient numbers

This perfect, abundant, and deficient number classifier focuses on what a number’s proper divisors reveal. Rather than considering only the integer itself, it examines the smaller positive whole numbers that divide it evenly. Adding those divisors produces a pattern that sorts every permitted input into one of three classic number-theory categories. The classification compares 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. The divisor sum can fall short of, match, or exceed the original number.

This aliquot-sum classifier is useful both for a quick category check and for studying divisor structure. Its result area exposes the arithmetic rather than hiding it: you can inspect the listed divisors, their count, their total, and the comparison with the input. That makes it useful when practicing factors, checking a proof, or verifying code that enumerates divisors.

How to use this perfect, abundant, and deficient number classifier

To classify a number by its proper divisors, enter a whole number from 1 through 100,000. The standard definitions used here concern positive integers and positive divisors. The default value, 28, is a useful first test because its proper divisors add exactly to 28.

1. Type a positive integer into the input field.
2. Leave Show All Divisors checked if you want to inspect every proper divisor in the calculation.
3. Select Classify Number to calculate the aliquot sum.
4. Read the classification, divisor list, sum, difference, and abundance index in the result panel.

To check a classification by hand, find factor pairs. For 36, the pairs are 1×36, 2×18, 3×12, 4×9, and 6×6. Removing 36 itself leaves 1, 2, 3, 4, 6, 9, 12, and 18 as proper divisors. They total 55, so 36 is abundant. The calculator applies the same proper-divisor rule automatically.

Comparing nearby integers is a useful way to see divisor behavior. Try 29 followed by 30, or 15 followed by 16. The aliquot sum can change sharply when an integer has several additional small factors. This helps explain why primes and many prime powers are deficient, while integers with many small divisors can be abundant.

Aliquot-sum formula and classification interpretation

The calculation behind this classifier is the aliquot sum: every positive divisor d of n that is less than n is included.

Once the aliquot sum is available, the label follows directly. If s(n) = n, the number is perfect. If s(n) > n, it is abundant. If s(n) < n, it is deficient. The result panel also gives the signed difference s(n) − n, showing how far the input is from perfection, and the abundance index s(n) / n, a relative comparison that is easier to use across different-sized integers.

• Proper divisors: the values included in the aliquot sum.
• Divisor count: the number of proper divisors found.
• Divisor sum: the aliquot sum s(n).
• Difference: the signed quantity s(n) − n.
• Abundance index: the ratio s(n)/n.

The aliquot sum is related to the divisor-sum function σ(n), which includes every positive divisor, including n. Their relationship is s(n) = σ(n) − n. Although some sources use σ(n)/n when discussing abundance, this classifier displays s(n)/n because its classification is based on proper divisors. Inputs are limited to 1 through 100,000 so direct trial division remains responsive in the browser.

Worked examples of perfect, abundant, and deficient numbers

A direct aliquot-sum example shows how the categories differ. For n = 12, the proper divisors are 1, 2, 3, 4, and 6, with a sum of 16. Because 16 exceeds 12, 12 is abundant. Its signed difference is 16 − 12 = 4, and its abundance index is 16/12 ≈ 1.3333. In contrast, n = 28 has proper divisors 1, 2, 4, 7, and 14; they total 28 exactly. It is therefore perfect, with difference zero and abundance index 1.0000.

For another abundant-number check, use n = 36. Its proper divisors are 1, 2, 3, 4, 6, 9, 12, and 18, which total 55. It is abundant by 19. This illustrates how several small factors can raise the aliquot sum quickly. A prime such as 97, by comparison, has only 1 as a proper divisor. Thus s(97) = 1, making it deficient by 96.

Several patterns are worth exploring in the input box. Primes are always deficient because 1 is their only proper divisor. Prime powers are also frequently deficient; 16, for example, has proper divisors 1, 2, 4, and 8, totaling 15. Many even composites with several small factors are abundant because their divisor lists grow quickly. Perfect numbers are much less common; small examples include 6, 28, 496, and 8128.

These reference values show the edge case of 1, deficient values, abundant composites, and perfect numbers. Comparing 29 with 30 is especially informative: 29 is prime and has aliquot sum 1, while 30 has several small proper divisors and is abundant. The contrast comes entirely from the different divisor structures.

Interpreting perfect, abundant, and deficient number results

What happens for 1? The classifier treats 1 as deficient. It has no positive proper divisors, so its aliquot sum is 0, which is less than 1. This edge case reinforces that a proper divisor must be smaller than the input.

Why list proper divisors instead of all divisors? Perfect, abundant, and deficient classifications are defined using proper divisors. Including the number itself would make the total at least n and would conceal the comparison that determines the category. Listing only proper divisors also makes s(n) − n meaningful.

How can you verify a result manually? Work through factor pairs. If 20 is divisible by 2, its paired divisor is 10; if it is divisible by 4, its paired divisor is 5. Continue until the trial divisor passes the square root, collect distinct proper divisors, and add them. For a perfect square, count its square-root divisor only once.

What does the abundance index mean? Here it is s(n)/n. An index above 1 means abundant, exactly 1 means perfect, and below 1 means deficient. Unlike the raw difference, the ratio describes the divisor sum relative to the number. For 12, an index of about 1.3333 means its proper divisors total about one-third more than 12.

Are odd perfect numbers known? No odd perfect number has been found, and it remains unknown whether one exists. All known perfect numbers are even. This classifier can test individual integers, but it does not resolve that open mathematical question.

What assumptions does the classifier use? It accepts positive integers from 1 to 100,000. The script checks every smaller positive integer for divisibility, a direct method that accurately returns the proper-divisor list for the supported range. Larger inputs would require more computation, but the definitions and comparisons would not change.

Where is this classification useful? Divisor sums provide practice with factorization and with distinguishing s(n) from σ(n). They also appear in programming exercises about divisor enumeration and in related topics such as amicable numbers, where the aliquot sum of each member of a pair is the other member. Examining the divisor list is often more instructive than memorizing category names.

For varied tests, try primes such as 2, 3, 5, 7, and 11; prime powers such as 8, 16, 27, and 32; composites such as 12, 18, 20, 24, 30, and 36; and perfect numbers including 6, 28, and 496. Watching the proper-divisor list change between categories builds intuition for why the classification changes.

About this perfect, abundant, and deficient number classifier. Results are calculated locally in your browser. When using an output in notes, homework, or programming documentation, include the proper-divisor list and aliquot sum so the classification can be checked.

Accessibility note. The classification result updates dynamically after form submission and is marked as a live region for assistive technologies. The optional divisor-tapping game is separate from the calculator; the explanation and main calculation remain complete without it.