11092
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 20160
- Proper Divisor Sum (Aliquot Sum)
- 9068
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5336
- Möbius Function
- 0
- Radical
- 5546
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 37
- 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
- Area under Dyck paths.at n=9A057571
- a(n) = a(n-1) + R(a(n-2)) + R(a(n-3)) where a(0)=a(1)=a(2)=1 and R(k) = A004086(k) is the reverse of k.at n=14A074860
- Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=6.at n=28A076672
- Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=7.at n=24A076673
- Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=10.at n=24A076675
- Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=11.at n=22A076676
- Numbers k such that 3*10^k - 11 is prime.at n=22A102737
- Triangle T, read by rows, formed by a column bisection of triangle A117418: column k of T equals column 2*k of A117418.at n=49A117425
- Binomial transform of A084239.at n=10A124523
- 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, 0, 0), (1, 0, -1), (1, 0, 0), (1, 1, 1)}.at n=7A150779
- Number of ways to place zero or more nonadjacent 0,0 1,0 2,0 2,1 3,0 4,0 4,1 5,0 polyhexes in any orientation on a planar nXnXn triangular grid.at n=7A155375
- Number of different fixed (possibly) disconnected trominoes bounded tightly by an n X n square.at n=43A163433
- Upper Beatty array of sqrt(2).at n=37A182638
- Number of n X n 0..2 arrays avoiding the pattern z z+1 z in any row, column, diagonal or antidiagonal.at n=2A206856
- Number of nX3 0..2 arrays avoiding the pattern z z+1 z in any row, column, diagonal or antidiagonal.at n=2A206858
- T(n,k)=Number of nXk 0..2 arrays avoiding the pattern z z+1 z in any row, column, diagonal or antidiagonal.at n=12A206863
- Numbers of words on alphabet {0,1,...,6} with no subwords ii, where i is from {0,1,...,4}.at n=5A254660
- Number of nX6 0..2 arrays with no element equal to any value at offset (-2,-2) (-1,0) or (-1,1) and new values introduced in order 0..2.at n=3A275129
- T(n,k)=Number of nXk 0..2 arrays with no element equal to any value at offset (-2,-2) (-1,0) or (-1,1) and new values introduced in order 0..2.at n=39A275131
- Number of 4 X n 0..2 arrays with no element equal to any value at offset (-2,-2) (-1,0) or (-1,1) and new values introduced in order 0..2.at n=5A275133