Aliquot sum
In number theory, the aliquot sum s(n) of a positive integer n is the sum of all proper divisors of n, that is, all divisors of n other than n itself. It can be used to characterize the prime numbers, perfect numbers, deficient numbers, abundant numbers, and untouchable numbers, and to define the aliquot sequence of a number.
Wikipage disambiguates
Wikipage redirect
10196 (number)199 (number)230 (number)240 (number)2520 (number)30 (number)39 (number)57 (number)662 (number)69 (number)77744 (number)91 (number)94 (number)95 (number)Abundant numberAliquotAliquot sequenceAliquot sum functionAliquot sumsAmicable tripleBetrothed numbersCorrectness (computer science)Deficient numberDivisor functionList of number theory topicsPerfect numberRestricted divisor functionS (disambiguation)Sociable numberUntouchable number
Link from a Wikipage to another Wikipage
primaryTopic
Aliquot sum
In number theory, the aliquot sum s(n) of a positive integer n is the sum of all proper divisors of n, that is, all divisors of n other than n itself. It can be used to characterize the prime numbers, perfect numbers, deficient numbers, abundant numbers, and untouchable numbers, and to define the aliquot sequence of a number.
has abstract
In number theory, the aliquot ...... aliquot sequence of a number.
@en
Wikipage page ID
12,374,274
page length (characters) of wiki page
Wikipage revision ID
976,161,049
Link from a Wikipage to another Wikipage
id
RestrictedDivisorFunction
@en
title
Restricted Divisor Function
@en
wikiPageUsesTemplate
hypernym
type
comment
In number theory, the aliquot ...... aliquot sequence of a number.
@en
label
Aliquot sum
@en