भाजकों की सारणी

नीचे दी गयी सारणियों में   १ से लेकर १०००० तक की पूर्णांकों के विभाजक पूर्णाक दर्शाए गए हैं।

सारणी में प्रयुक्त संकेत

 d(n) 1 तथा उस संख्या (n) को मिलाकर n के कुल धनात्मक विभाजकों की संख्या
 σ(n) is the sum of the positive divisors of n, including 1 and n itself
 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 proper divisors greater than any lesser number's sum of proper divisors; that is, s(n) > s(m) for every positive integer m < n 
note: confusingly, the first seven highly abundant numbers aren't even abundant numbers
a prime number has only 1 and itself as divisors; that is, d(n) = 2.  Prime numbers are always deficient as s(n)=1
a composite number has more than just 1 and itself as divisors; that is, d(n) > 2
a highly composite number has more divisors than any lesser number; that is, d(n) > d(m) for every positive integer m < n
note: confusingly, the first two highly composite numbers aren't even composite numbers
a superior highly composite number has more divisors than any other number scaled relative to some positive power of the number itself; that is, there exists some ε such that  for every other positive integer m. Superior highly composite numbers are always highly composite numbers
a weird number is an abundant number that is not semiperfect; that is, no subset of the proper divisors of n sum to n

1 से 100 तक

101 से 200

201 से 300 तक

301 से 400 तक

401 से 500 तक

501 से 600 तक

601 से 700 तक

701 से 800 तक

801 से 900 तक

901 से 1000 तक

इन्हें भी देखें
 Table of prime factors

बाहरी कड़ियाँ
 

आरारंभिक संख्या-सिद्धान्त
संखाएँ