11934
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 30240
- Proper Divisor Sum (Aliquot Sum)
- 18306
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3456
- Möbius Function
- 0
- Radical
- 1326
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 143
- 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
- a(n) = 3*(2*n)!/((n+2)!*(n-1)!).at n=9A000245
- Number of partitions of 3n-1 into n nonnegative integers each no more than 6.at n=24A001978
- McKay-Thompson series of class 3B for the Monster group.at n=8A007244
- Catalan's triangle T(n,k) (read by rows): each term is the sum of the entries above and to the left, i.e., T(n,k) = Sum_{j=0..k} T(n-1,j).at n=63A009766
- Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k*n; sequence gives the (4,k)-perfect numbers.at n=42A019293
- a(n) = T(n, floor(n/2)), where T = Catalan triangle (A008315).at n=17A026008
- Triangle T(n,m) = Sum_{k=0..m} Catalan(n-k)*Catalan(k).at n=53A028364
- Concatenate rows of triangle in A028364 (removing duplicates).at n=45A028378
- McKay-Thompson series of class 3B for the Monster group with a(0) = -12.at n=8A030182
- Catalan's triangle with right border removed (n > 0, 0 <= k < n).at n=53A030237
- Triangle formed from even-numbered columns of triangle of expansions of powers of x in terms of Chebyshev polynomials U_n(x).at n=46A039599
- McKay-Thompson series of class 3B for the Monster group with a(0) = -3.at n=8A045481
- All differences C(j)-C(i), j>i, of Catalan numbers A000108.at n=37A047075
- a(n) is twice the coefficient of the radical part in the fundamental unit of Q(sqrt(A000037(n))) where A000037 lists the nonsquare numbers (Version 1).at n=58A048942
- Triangle T(n,k), k>=0 and n>=1, read by rows defined by: T(n,k) = (2k+3)*binomial(2n,n-k-1)/(n+k+2).at n=36A050155
- T(n, k) = S(2*n + 1, n, k + 1) for 0<=k<=n and n >= 0, array S as in A050157.at n=37A050158
- T(n,k) = S(2n-1,n-1,k-1), 0<=k<=n, n >= 0, array S as in A050157.at n=47A050159
- T(n,k) = S(2n,n-1,k-1), 0 <= k <= n, n >= 0, array S as in A050157.at n=46A050160
- T(n, k) = S(2n+2, n+2, k+2) for 0<=k<=n and n >= 0, array S as in A050157.at n=36A050163
- Triangle read by rows: T(n,k) = M(2n+1,k,-1), 0 <= k <= n, n >= 0, array M as in A050144.at n=53A050165