8993
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 9954
- Proper Divisor Sum (Aliquot Sum)
- 961
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8096
- Möbius Function
- 0
- Radical
- 391
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 78
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = n*(11*n^2 - 5)/6.at n=17A004467
- Convolution of natural numbers >= 2 and natural numbers >= 3.at n=33A023545
- Number of partitions in parts not of the form 15k, 15k+3 or 15k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 6 are greater than 1.at n=37A035957
- Haüy rhombic dodecahedral numbers.at n=8A046142
- Numbers k such that Sum_{i=1..k} phi(i)/gcd(k,i) is an integer.at n=37A066969
- Engel expansion of log(23).at n=12A067923
- Let b(1)=1, b(2)=2, b(n) = sum of digits of b(1)+b(2)+b(3)+...+b(n-1), sequence gives values of n such that b(n)=3.at n=22A084229
- Erroneous version of A046142.at n=9A085636
- a(n) = the least positive k such that (n+k)+1 and (n*k)+1 are both squares; or 0 if no such k exists.at n=30A093482
- Let pi be an unrestricted partition of n with the summands written as binary numbers; a(n) is the number of such partitions with an even number of binary ones.at n=36A102425
- Number of base 5 circular n-digit numbers with adjacent digits differing by 1 or less.at n=9A124698
- Ramanujan numbers (A000594) read mod 23^3.at n=27A126847
- Numbers having exactly two distinct prime factors p, q with q = p+6.at n=30A143205
- a(n) = (n^3 - n + 9)/3.at n=29A155753
- Concentric 17-gonal numbers.at n=46A195047
- Numbers with largest and smallest prime factors differing by 6.at n=39A195118
- Number of (w,x,y,z) with all terms in {1,...,n} and median=mean.at n=17A212133
- Products of 3 evil primes (A027699) p,q,r, such that numbers p*q, p*r, q*r, and p*q*r are odious (A000069).at n=11A230353
- Number of partitions of n such that (greatest part) <= (multiplicity of least part).at n=42A240182
- Number of compositions of n with difference -1 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=15A242840