Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Table of divisors
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Key to the tables == *[[Divisor function | ''d''(''n'')]] is the number of the positive divisors of ''n'', including 1 and ''n'' itself *[[Divisor function | Ο(''n'')]] is the sum of the positive divisors of ''n'', including 1 and ''n'' itself *[[Divisor function | ''s''(''n'')]] is the sum of the proper divisors of ''n'', including 1 but not ''n'' itself; that is, ''s''(''n'') = Ο(''n'') − ''n'' *a [[deficient number]] is greater than the sum of its proper divisors; that is, ''s''(''n'') < ''n'' *a [[perfect number]] equals the sum of its proper divisors; that is, ''s''(''n'') = ''n'' *an [[abundant number]] is lesser than the sum of its proper divisors; that is, ''s''(''n'') > ''n'' *a [[highly abundant number]] has a sum of positive divisors that is greater than any lesser number; that is, Ο(''n'') > Ο(''m'') ''for every positive integer m'' < ''n''. Counterintuitively, the first seven ''highly abundant'' numbers (as well as the ninth) are not ''abundant'' numbers. *a [[prime number]] has only 1 and itself as divisors; that is, ''d''(''n'') = 2 *a [[composite number]] has more than just 1 and itself as divisors; that is, ''d''(''n'') > 2 *a [[highly composite number]] has a number of positive divisors that is greater than any lesser number; that is, ''d''(''n'') > ''d''(''m'') ''for every positive integer m'' < ''n''. Counterintuitively, the first two ''highly composite'' numbers are not ''composite'' numbers. *a [[superior highly composite number]] has a ratio between its number of divisors and itself raised to some positive power that equals or is greater than any other number; that is, ''there exists some Ξ΅ such that'' <math>\frac{d(n)}{n^\varepsilon}\geq\frac{d(m)}{m^\varepsilon}</math> ''for every other positive integer m'' *a [[primitive abundant number]] is an ''abundant'' number whose proper divisors are all ''deficient'' numbers *a [[weird number]] is a number that is ''abundant'' but not [[semiperfect]]; that is, ''no subset of the proper divisors of n sum to n''
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)