Amicable Number Checker screenshot

Amicable Number Checker

Check whether two whole numbers are an amicable pair by comparing each one's proper-divisor sum exactly.

Privacy First
0 Runs
Updated 2026-11-22
No upload
Instant
No signup

Amicable Number Checker

Check whether two whole numbers are an amicable pair by comparing each one's proper-divisor sum exactly.

How this page computes

Both numbers must be between 2 and one trillion, the range the trial-division factoriser handles instantly. The page states that range rather than failing halfway through a calculation.

The calculation runs entirely in this browser tab; nothing is uploaded.

The page computes the sum of the proper divisors of each number and reports the pair as amicable only when each sum equals the other number. 220 and 284 are the classic pair: the proper divisors of 220 sum to 284, and those of 284 sum to 220.

Both sums are printed whether or not the pair matches, so a near miss such as 220 and 285 shows exactly where it fails. A number paired with itself is refused, because an amicable pair is two different numbers.

How to use the Amicable Number Checker

Enter the two whole numbers separated by a space, a comma or a new line, then press Run. The first line says amicable or not amicable and repeats the pair.

The next two lines give the proper-divisor sum of each number, written s(n), so the comparison can be checked line by line. A mismatch is visible immediately: the sums simply do not name the other number.

The rule this page applies

Two numbers are amicable when the sum of the proper divisors of each equals the other. This is the aliquot sequence of length two, and a perfect number is the length-one case the page deliberately excludes.

Both numbers must be between 2 and one trillion, the range the trial-division factoriser handles instantly. The page states that range rather than failing halfway through a calculation.

What to Expect

Best for

  • Testing a claimed amicable pair
  • Exploring aliquot sequences
  • Checking a recreational number theory fact

Not ideal for

  • Finding new amicable pairs by search
  • Pairs above one trillion
  • A single number on its own

What this tool keeps

  • Both numbers and both proper-divisor sums

What may need cleanup

  • Nothing: the verdict and both sums are final

Common errors

  • A number below 2 is refused, because the aliquot sum is defined there
  • The same number twice is refused, because a pair needs two different numbers

Example use cases

  • Verify 220 and 284
  • See why 220 and 285 is not a pair

Sample input

220 284

Sample output

amicable: 220 and 284 s(220) = 284 s(284) = 220

Who this is for

  • Number theory students
  • Readers checking a recreational maths claim

Frequently asked questions

What does s(n) mean?

It is the sum of the proper divisors of n, that is, every positive divisor smaller than n. The page prints it for each number so the amicable test is visible rather than asserted.

Are perfect numbers amicable?

No, and the page refuses a number paired with itself. 6 is perfect because its proper divisors sum to 6, but amicable pairs are two different numbers whose sums point at each other.

Why only up to one trillion?

Each sum is found by trial division to the square root. One trillion is a million steps, which stays instant; a larger input would make the page wait without warning, so it is refused with the ceiling named.

Is anything uploaded?

Nothing is uploaded. The numbers are read and the arithmetic runs in this browser tab with JavaScript, and reloading the page discards both the input and the result.

Developer program

Build custom tools for your store

Join the SDK program to create useful ecommerce utilities for your store.