Number Properties Calculator

Results

Prime factorization: 496 = 2⁴ × 31

Digital root: 1

Properties

Divisors

The proper divisors (all divisors except 496 itself) add up to 496, exactly 496.

All 10 divisors, in order:

1, 2, 4, 8, 16, 31, 62, 124, 248, 496

How to Use the Number Properties Calculator

1. 1. Enter a whole number. Anything from 1 to 10²⁰; spaces between digit groups are ignored. Decimals, fractions and negative numbers are not classified.
2. 2. Read the headline figures. The cards show whether the number is perfect, abundant or deficient, how many divisors it has, their sum, and Euler's totient φ(n).
3. 3. Scan the property table. Each row gives a Yes or No and the reason — for example 496 = 1 + 2 + … + 31 for a triangular number, or the two squares a non-square falls between.
4. 4. Check the divisors. Numbers with 240 or fewer divisors list them all, with the proper-divisor sum written out when it is short enough to read.

How Each Property Is Decided

Perfect, Abundant and Deficient Numbers

The Greeks sorted numbers by comparing each one with the sum of its proper divisors — the divisors other than the number itself. That sum is σ(n) − n, where σ(n) is the sum of all divisors. If it equals n the number is perfect; if it is larger the number is abundant; if it is smaller the number is deficient. Every prime is deficient, because its only proper divisor is 1, and so is every power of a prime.

28:  1 + 2 + 4 + 7 + 14 = 28   → perfect
12:  1 + 2 + 3 + 4 + 6 = 16    → abundant (16 > 12)
8:   1 + 2 + 4 = 7             → deficient (7 < 8)

The first perfect numbers are 6, 28, 496, 8128 and 33550336. The Euclid–Euler theorem says every even perfect number has the form 2^p−1(2^p − 1) with 2^p − 1 a prime (a Mersenne prime), which is why they are also all triangular: 496 is the 31st triangular number and 8128 the 127th. Whether an odd perfect number exists is a famous open problem; none has been found. The smallest odd abundant number is 945.

Worked Example: 496

1. Factor it. 496 = 2⁴ × 31.
2. Count the divisors. (4 + 1)(1 + 1) = 10: 1, 2, 4, 8, 16, 31, 62, 124, 248 and 496.
3. Sum them. σ(496) = (2⁵ − 1)(31 + 1) = 31 × 32 = 992. The proper divisors add up to 992 − 496 = 496, so 496 is perfect.
4. Read the rest. It is even, composite and not a square; it is the 31st triangular number (496 = 31 × 32 ÷ 2); its neighbouring Fibonacci numbers are 377 and 610, so it is not one; and φ(496) = 240.

Two curiosities show up with 144, which is both a perfect square and the 12th Fibonacci number. The only perfect squares in the Fibonacci sequence are 0, 1 and 144 — a result proved by J. H. E. Cohn in 1964.

Frequently Asked Questions

What is a perfect number?

A positive integer equal to the sum of its proper divisors — all its divisors except itself. 6 = 1 + 2 + 3 and 28 = 1 + 2 + 4 + 7 + 14 are the smallest. All the perfect numbers known are even, and each corresponds to a Mersenne prime.

What is the difference between abundant and deficient numbers?

Compare the sum of the proper divisors with the number. If the sum is bigger, the number is abundant (12 has 1 + 2 + 3 + 4 + 6 = 16). If it is smaller, the number is deficient (8 has 1 + 2 + 4 = 7). Most small numbers are deficient; the first few abundant ones are 12, 18, 20, 24 and 30.

How do I know if a number is triangular?

Compute 8n + 1. If it is a perfect square, n is triangular, and its position is (√(8n + 1) − 1) ÷ 2. For 36, 8 × 36 + 1 = 289 = 17², so 36 is the 8th triangular number, 1 + 2 + … + 8.

How do I check if a number is a Fibonacci number?

A number n is Fibonacci exactly when 5n² + 4 or 5n² − 4 is a perfect square. For 21, 5 × 441 − 4 = 2201 is not a square but 5 × 441 + 4 = 2209 = 47², so 21 is Fibonacci — it is the 8th, F(8). The calculator simply walks along the sequence.

Is 1 a square, a cube and a Fibonacci number?

Yes to all three: 1 = 1² = 1³, and 1 appears twice at the start of the Fibonacci sequence, as F(1) and F(2). It is also triangular, odd, a palindrome and a power of 2 (2⁰). It is not prime, and it is deficient because it has no proper divisors at all.

What does Euler's totient φ(n) count?

The whole numbers from 1 to n that share no factor with n other than 1. φ(12) = 4 because only 1, 5, 7 and 11 qualify. The calculator gets it from the prime factorization: multiply n by (1 − 1/p) for each prime p dividing n.

Why is there a limit of 10²⁰?

Divisor sums, the divisor count and the totient all need the full prime factorization, and numbers up to 10²⁰ are factored in a fraction of a second in the browser. For larger numbers the prime checker still works, but a full divisor profile would not.