11886
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 27264
- Proper Divisor Sum (Aliquot Sum)
- 15378
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3384
- Möbius Function
- 1
- Radical
- 11886
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 50
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Number of partitions of n into prime power parts (1 included); number of nonisomorphic Abelian subgroups of symmetric group S_n.at n=39A023893
- Number of labeled vertically indecomposable lattices with a fixed bottom.at n=7A058804
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,25.at n=3A064249
- G.f.: (x+4*x^3+x^5)/((1-x)^2*(1-x^2)^2*(1-x^3)).at n=26A083707
- Number of partitions of n such that there is exactly one part which occurs twice, while all other parts occur only once.at n=53A090858
- Number of compositions of n into 4 parts such that no two adjacent parts are equal.at n=39A106353
- a(n) = a(n-1)+4*a(n-2)-4*a(n-4).at n=13A107385
- a(n) = a(n-1) + Sum_{0<k<=n/5} a(n-5k) with a(0)=1.at n=33A113444
- Triangle T(n,k) = total of number at last index for all set partitions of n into k parts.at n=41A120095
- "666" in bases 7 and higher rewritten in base 10.at n=37A121205
- Number of planar n X n X n binary triangular grids symmetric under 120 degree rotation with no more than 8 ones in any 5 X 5 X 5 subtriangle.at n=9A153962
- Row sums of A163233 and A163235 divided by 3.at n=36A163478
- Second accumulation array, T, of the natural number array A000027, by antidiagonals.at n=83A185507
- G.f. satisfies: A(x) = A(x^2)^3 + x*A(x^2)^2.at n=22A195200
- prime(n^2) - prime(n).at n=37A213926
- Partitions with parts repeated at most twice and repetition only allowed if first part has an odd index (first index = 1).at n=49A227134
- Numbers k such that k+1, 2*k+1 and k^2+1 are primes.at n=43A236692
- Number of (n+2) X (2+2) 0..1 arrays with each row divisible by 7 and column not divisible by 7, read as a binary number with top and left being the most significant bits.at n=6A262844
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each row divisible by 7 and column not divisible by 7, read as a binary number with top and left being the most significant bits.at n=34A262849
- a(n) = Sum_{k = 0..n - 1} (a(n - 1) + k) for n>0, a(0) = 1.at n=7A266083