See what's waiting in the wings and vote for what you would like to see next. Here's a program to let you start exploring the interesting topic of Perfect, Amicable, and Sociable numbers. They are defined by the sums of their aliquot divisors. The aliquot divisors of a number are all of its divisors except the number itself.
Perfect numbers are few and far between.
The first 3 are easily found, the 4th can be found if you set the upper limit high enough, it's up around 3,500,000 as I recall. Amicable pairs are fairly common but search times get long when we get up in the millions. TIntEdit is available here . You will need to install it before compiling AliquotSums or change TIntEdits to TEdits and write your own code to check and convert edit text value to Int64 values. One problem is that we need to find all factors and Primes returns only the prime factors.