Perfect Number Checker

Perfect Number Checker | Online Free Tool | Elysia Tools

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

1Enter an integer n between 1 and 10¹² and select whether to output classification statistics only or include the list of proper divisors.
2The tool performs trial-division prime factorization to determine prime factors and their exponents.
3Using multiplicative properties, it calculates σ(n), derives the proper-divisor sum (σ(n) − n), and determines the abundancy index.
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.

n = 12, detail = classification

Run this tool

Examples that match this tool

Continue with connected tools and hubs

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

Key facts

Overview

When to use

How it works

Use cases

Examples

1. Verifying the perfect number 28

2. Classifying the abundant number 12

FAQ

Web Image Processing Python Samples

EU VAT Number Samples

Global Phone Number Samples

Number & Currency Samples

Dimensional Analysis Unit Cancellation Tutor

PERT Network Analyzer (Expected Duration & Variance)

Prime Number Checker

M/M/c Multi-Server Queue Calculator