Elysia Tools

Browse tools, examples, visual explainers, and topic guides from one clear workspace.

Top Categories

Hubs

Language
ZHDERUPTENFRES

Elysia Tools

Navigation

Math & Numbers

Perfect Number Checker

· Last updated:2026-08-28

σ(n) = 2n ⟺ perfect. Factorization-based σ(n), proper-divisor sum, deficient/perfect/abundant classification, abundancy index, Euclid–Euler form. n ≤ 10¹².

Execution

Run this tool

Fill in the form, run the tool, and review the result in one place.

Samples

Examples that match this tool

Related

Continue with connected tools and hubs

Written by the Elysia Tools team

Tool usage guide

Learn when to use this tool, what it supports, and how real users apply it.

Key facts

Category
Math & Numbers
Input types
text, select
Output type
text
Sample coverage
4
API ready
Yes

Overview

The Perfect Number Checker analyzes integers up to 10¹² to determine whether they are perfect, deficient, or abundant based on prime factorization and proper divisor sums. It computes the sum-of-divisors function σ(n), the abundancy index σ(n)/n, identifies Euclid–Euler form parameters for even perfect numbers, and can list proper divisors.

When to use

  • Verifying whether a given integer equals the sum of its proper divisors.
  • Classifying integers up to 10¹² as deficient, perfect, or abundant alongside their abundancy index.
  • Deconstructing known even perfect numbers into their Euclid–Euler form 2^(p−1)·(2^p − 1) and associated Mersenne primes.

How it works

  1. 1Enter an integer n between 1 and 10¹² and select whether to output classification statistics only or include the list of proper divisors.
  2. 2The tool performs trial-division prime factorization to determine prime factors and their exponents.
  3. 3Using multiplicative properties, it calculates σ(n), derives the proper-divisor sum (σ(n) − n), and determines the abundancy index.
  4. 4For perfect numbers, it matches the value against the Euclid–Euler form to display prime exponent p and corresponding Mersenne prime (2^p − 1).

Use cases

  • Checking number theory homework problems involving aliquot sums and divisor functions.
  • Exploring properties of small abundant numbers and calculating exact abundancy indices.
  • Studying Mersenne primes and validating even perfect numbers within the range up to 10¹².

Examples

1. Verifying the perfect number 28

Math Student

Background

A student needs to show step-by-step divisor calculations for the number 28 in an introductory discrete math course.

Problem

Determine whether 28 is perfect, find its proper divisor sum, and express it in Euclid–Euler form.

How to use

Enter 28 in the Number field and select 'Also list proper divisors (when count ≤ 200)' from the Output detail dropdown.

n = 28, detail = divisors

Outcome

Displays prime factors 2² × 7, σ(28) = 56, proper divisor sum of 28, abundancy index 2.0, and Euclid–Euler form 2²·(2³ − 1) with Mersenne prime 7.

2. Classifying the abundant number 12

Number Theory Instructor

Background

An instructor wants to demonstrate the smallest abundant number during a classroom lecture.

Problem

Show why 12 is abundant and compute its exact abundancy index.

How to use

Enter 12 in the Number field and select 'Classification and statistics' as the Output detail.

FAQ

What is a perfect number?

A perfect number is a positive integer that equals the sum of its proper divisors, meaning σ(n) = 2n.

What is the difference between deficient, perfect, and abundant numbers?

A number is deficient if the sum of its proper divisors is less than n, perfect if equal to n, and abundant if greater than n.

What is the maximum value of n supported?

The tool supports integers n from 1 up to 10¹² (1,000,000,000,000).

When does the tool list individual proper divisors?

Proper divisors are listed when the 'Output detail' option is set to include divisors and the total proper divisor count is 200 or fewer.

How does the tool identify the Euclid–Euler form?

For even perfect numbers, it expresses n as 2^(p−1)·(2^p − 1), verifying the exponent p and Mersenne prime factor.

Home
Tools3212
Samples593
Visualizations471
Viewers103
Hubs239
Tags333
Images, Audio & Video657

Image, audio, and video processing, conversion, and optimization tools

Math, Date & Finance647

Calculators, numerics, date logic, statistics, and finance tools

Design & Color298

Color, layout, graphics, visual styling, and design helper tools

Text & Writing209

Writing, cleanup, formatting, extraction, and text analysis tools

Developer & Web193

Developer utilities, networking, web debugging, and automation helpers

Conversion & Encoding175

Format, file, archive, unit, and encoding conversion tools

Lead Generation Quiz Launch and Contact Handoff
Memorial Drafts: Family Review and Print Handoff
Private Habit Records: Backup, Restore and Sharing Review
Article to X and LinkedIn Drafts: Fact Review and Handoff
Markdown Interactive Deck Review and Offline Handoff

© 2026 Elysia Tools. All rights reserved.

DocsPricingAboutTerms of ServicePrivacy PolicyCookiesContact
Python

Web Image Processing Python Samples

Web Python image processing examples using PIL/Pillow including reading, saving, resizing, and format conversion

Validation

EU VAT Number Samples

Collection of EU VAT numbers from all member states for validation testing

Validation

Global Phone Number Samples

Collection of phone numbers from various countries for validation testing

Text Processing

Number & Currency Samples

Text containing various number and currency formats for testing currency extraction

Math & Numbers

Dimensional Analysis Unit Cancellation Tutor

Step-by-step factor-label unit cancellation with inverted-factor diagnosis and optional student-answer checking.

Math & Numbers

PERT Network Analyzer (Expected Duration & Variance)

Three-point PERT estimates: te and σ² per activity, critical path, expected project duration and variance, and normal completion probability for a target time.

Math & Numbers

Prime Number Checker

Check if a number is prime (a natural number greater than 1 that has no positive divisors other than 1 and itself)

Math & Numbers

M/M/c Multi-Server Queue Calculator

Steady-state M/M/c metrics with the Erlang-C formula: offered load, P0, Pw, Lq, L, W, Wq plus Little's-law cross-checks; unstable λ ≥ cμ inputs are rejected.

n = 12, detail = classification

Outcome

Shows prime factorization 2² × 3, proper divisor sum of 16 (which exceeds 12), and an abundancy index of 2.333333, confirming it is abundant.