11386
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17082
- Proper Divisor Sum (Aliquot Sum)
- 5696
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5692
- Möbius Function
- 1
- Radical
- 11386
- Omega Function (Ω)
- 2
- 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
- 68
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- a(n) = (11*n^2 - 11*n + 2)/2.at n=45A069125
- Sum of terms in n-th row of A077164.at n=22A077167
- Number of noncrossing partitions of [n] with all blocks of odd size and 1 and n in the same block.at n=13A113337
- a(n) = -a(n-1) + 2a(n-2) - a(n-3), with a(0) = 0, a(1) = 1, a(2) = -3.at n=13A135019
- a(1) = 1, a(n) = Sum_{k=1..n} (k mod 3) * a(n-k) for n >= 2.at n=13A141685
- a(n) = Sum of all numbers of divisors of all numbers < (n+1)^2.at n=37A168011
- a(1)=a(2)=a(3)=1, a(4)=3; thereafter a(n) = a(n-1) + a(n-3).at n=25A179070
- Floor-Sqrt transform of Catalan numbers (A000108).at n=17A186546
- Number of length n+6 0..2 arrays with at most two downsteps in every 6 consecutive neighbor pairs.at n=2A255620
- T(n,k)=Number of length n+k 0..2 arrays with at most two downsteps in every k consecutive neighbor pairs.at n=30A255622
- Number of length n+3 0..2 arrays with at most two downsteps in every n consecutive neighbor pairs.at n=5A255625
- Expansion of Product_{k>=1} ((1 - k*x^k) / (1 - x^k)).at n=33A267005
- T(n, k) is the number of k-element connected subposets of the n-th Boolean lattice, 0 <= k <= 2^n.at n=28A270952
- a(n) = [x^n] Product_{k>=1} ((1 + x^(2*k-1))/(1 + x^(2*k)))^n.at n=11A296043
- Numbers k such that k^2 reversed is a prime and k^2+(k^2 reversed) is a prime.at n=27A306301
- Number of maximal intersecting antichains of sets covering n vertices with no singletons.at n=6A326361
- 2nd row of the 3-Zeckendorf array (A136189), including prepended terms.at n=26A372760