In number theory, a highly abundant number is a natural number with the property that the sum of its divisors (including itself) is greater than the sum...

In number theory, an abundant number or excessive number is a positive integer for which the sum of its proper divisors is greater than the number. The...

also the twentieth abundant and highly abundant number (with 20 the first primitive abundant number and 70 the second). The number of divisors of 90 is...

natural number that follows 41 and precedes 43. 42 is a pronic number, an abundant number as well as a highly abundant number, a practical number, an admirable...

In number theory, a colossally abundant number (sometimes abbreviated as CA) is a natural number that, in a particular, rigorous sense, has many divisors...

A highly composite number is a positive integer that has more divisors than all smaller positive integers. If d(n) denotes the number of divisors of a...

it the 14th highly composite number. a highly abundant number. a Harshad number in every base from binary to decimal. the smallest number to be palindromic...

natural number following 11 and preceding 13. Twelve is the 3rd superior highly composite number, the 3rd colossally abundant number, the 5th highly composite...

In number theory, a superior highly composite number is a natural number which, in a particular rigorous sense, has many divisors. Particularly, it is...

natural number following 1979 and preceding 1981. 1980 is a pronic number, a highly abundant number, an e-perfect number and a coreful perfect number. Not...

superabundant numbers are highly abundant. Not all superabundant numbers are Harshad numbers. The first exception is the 105th superabundant number, 149602080797769600...

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...

primitive abundant number is an abundant number whose proper divisors are all deficient numbers. For example, 20 is a primitive abundant number because:...

semiperfect number is 945. A semiperfect number is necessarily either perfect or abundant. An abundant number that is not semiperfect is called a weird number. With...

A highly totient number k {\displaystyle k} is an integer that has more solutions to the equation ϕ ( x ) = k {\displaystyle \phi (x)=k} , where ϕ {\displaystyle...

perfect number. Most abundant numbers are also semiperfect; abundant numbers which are not semiperfect are called weird numbers. Hyperperfect number Multiply...

In number theory, a branch of mathematics, a highly cototient number is a positive integer k {\displaystyle k} which is above 1 and has more solutions...

the first superior highly composite number, and the first colossally abundant number. An integer is determined to be even if it is divisible by two. When...

In number theory, a weird number is a natural number that is abundant but not semiperfect. In other words, the sum of the proper divisors (divisors including...

number, the 19th highly composite number, an abundant number, the 8th colossally abundant number and the number of permutations of 4 items out of 10 choices...

month, the number of pairs of rabbits is equal to the number of mature pairs (that is, the number of pairs in month n – 2) plus the number of pairs alive...

/n\mathbb {Z} } . Highly composite number Rough number Round number Størmer's theorem Unusual number "P-Smooth Numbers or P-friable Number". GeeksforGeeks...

they were previously discovered in the 1730s by Minggatu. The n-th Catalan number can be expressed directly in terms of the central binomial coefficients...

} {\displaystyle \{1,p,p^{2}\}} . A number n that has more divisors than any x < n is a highly composite number (though the first two such numbers are...

In number theory, a lucky number is a natural number in a set which is generated by a certain "sieve". This sieve is similar to the sieve of Eratosthenes...

In number theory, friendly numbers are two or more natural numbers with a common abundancy index, the ratio between the sum of divisors of a number and...

A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that...

superior highly composite number, the 4th colossally abundant number, the 9th highly composite number, a unitary perfect number, and an abundant number. It...

superior highly composite number, the 2nd colossally abundant number, the 3rd triangular number, the 4th highly composite number, a pronic number, a congruent...

{\displaystyle \varphi (n)=p(p-1)=n-p.} Semiprimes are highly useful in the area of cryptography and number theory, most notably in public key cryptography,...