11804
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 22344
- Proper Divisor Sum (Aliquot Sum)
- 10540
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5424
- Möbius Function
- 0
- Radical
- 5902
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 99
- 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
- yes
- Odd
- no
Appears in sequences
- Coordination sequence for 4-dimensional I-centered tetragonal orthogonal lattice.at n=13A001386
- Number of n-digit reversible primes (or emirps) with distinct digits.at n=8A003684
- Values of A038007 not ending in 6 or 8.at n=21A038009
- Arithmetic derivative of n*prime(n).at n=39A068981
- Number of partitions that are "2-close" to being self-conjugate.at n=47A108961
- Expansion of E.g.f. (1 + 2*x + x^2/2) * sech(x).at n=10A119883
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (0, 0, 1), (1, -1, 0), (1, 0, 0)}.at n=9A149828
- Numbers k such that 2^k + k - 1 is a prime.at n=13A173063
- Number of n X 2 0..3 arrays with rows and columns lexicographically nondecreasing read forwards and nonincreasing read backwards.at n=30A201975
- G.f.: Sum_{n>=0} x^(n*(n+1)/2) / Product_{k=1..n} (1 - (n-k+1)*x^k).at n=14A204855
- Number of n X n 0..2 arrays avoiding the pattern z-1 z-1 z in any row, column or nw-to-se diagonal.at n=2A206726
- Number of nX3 0..2 arrays avoiding the pattern z-1 z-1 z in any row, column or nw-to-se diagonal.at n=2A206729
- T(n,k)=Number of nXk 0..2 arrays avoiding the pattern z-1 z-1 z in any row, column or nw-to-se diagonal.at n=12A206734
- Number of n X n 0..2 arrays avoiding the pattern z z+1 z in any row, column or nw-to-se diagonal.at n=2A206951
- Number of nX3 0..2 arrays avoiding the pattern z z+1 z in any row, column or nw-to-se diagonal.at n=2A206952
- T(n,k)=Number of nXk 0..2 arrays avoiding the pattern z z+1 z in any row, column or nw-to-se diagonal.at n=12A206957
- Number of 2 X 2 matrices having all elements in {-n,...n} and determinant 2.at n=28A209984
- a(n) = 1 + n + ((n-1)*n^2)/2.at n=29A218152
- G.f.: Sum_{n>=0} x^n * (1+x)^A003188(n), where A003188(n) = n XOR [n/2] is the Gray code for n.at n=18A227526
- Number of length n binary words that contain at least one pair of consecutive 0's followed by (at some point in the word) at least one pair of consecutive 1's.at n=14A235996