11508
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 30912
- Proper Divisor Sum (Aliquot Sum)
- 19404
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3264
- Möbius Function
- 0
- Radical
- 5754
- Omega Function (Ω)
- 5
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 55
- 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
- Three-fold exponential convolution of Catalan numbers with themselves.at n=6A014333
- Triangle of labeled mobiles (circular rooted trees) with n nodes and k leaves.at n=25A055349
- Number of labeled mobiles (circular rooted trees) with n nodes and 5 leaves.at n=1A055352
- a(n) is the least k such that (10^k)*Mersenne-prime(n) + 1 is prime.at n=24A102629
- McKay-Thompson series of class 18g for the Monster group.at n=55A112156
- Triangle read by rows: T(n,k) = a(k)*binomial(n,k) (0 <= k <= n), where a(0)=1, a(1)=2, a(k) = a(k-1) + 3*a(k-2) for k >= 2 (a(k) = A006138(k)).at n=51A124959
- 6 times heptagonal numbers: a(n) = 3*n*(5*n-3).at n=28A153786
- G.f. is the polynomial (1-x^3) * (1-x^6) * (1-x^9) * (1-x^12) * (1-x^15) * (1-x^18) * (1-x^21) * (1-x^24) * (1-x^27) * (1-x^30) * (1-x^33) * (1-x^36) * (1-x^39) * (1-x^42) * (1-x^45) / (1-x)^15.at n=5A162635
- a(n) = (n+2)! * Sum_{k=1..n} 1/k.at n=5A180218
- Exponential Riordan array, defining orthogonal polynomials related to permutations without double falls.at n=51A182822
- The number of ways of putting n labeled items into k labeled boxes so that each box receives at least 2 objects.at n=18A200091
- Number of 2 X 2 matrices having all elements in {-n,...,n} and determinant 1.at n=34A209982
- Numbers k such that 26*k+1 is a square.at n=42A217441
- Number of doubly-surjective functions f:[n]->[3].at n=3A224541
- Numbers n representable as x*y + x + y, where x >= y > 1, such that all x's and y's in all representation(s) of n are perfect squares.at n=24A258366
- Number of length n arrays of permutations of 0..n-1 with each element moved by -4 to 4 places and every four consecutive elements having its maximum within 4 of its minimum.at n=20A263713
- a(n) is the sum of the prime factors (with repetition) of the sum of the preceding terms; a(1)=a(2)=1.at n=51A268868
- a(n) is the sum of the prime factors, with repetition, of the sum of all preceding terms, with initial terms a(1)=1 and a(2)=2.at n=36A269004
- G.f.: exp( Sum_{n>=1} A052886(n) * x^n/n ).at n=6A293379
- Square array A(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of e.g.f. exp(2*k*x)*(BesselI(0,2*x) - BesselI(1,2*x))^k.at n=51A294498