11565
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
- 12
- Divisor Sum
- 20124
- Proper Divisor Sum (Aliquot Sum)
- 8559
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6144
- Möbius Function
- 0
- Radical
- 3855
- 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
- 50
- 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
- no
- Odd
- yes
Appears in sequences
- The limiting sequence [A259095(r(r+1)/2-s,r), s=0,1,2,...,r-1] for very large r.at n=38A005576
- Numbers k such that k divides the (left) concatenation of all numbers <= k written in base 16 (most significant digit on right and removing all least significant zeros before concatenation).at n=17A029533
- Base 4 digits are, in order, the first n terms of the periodic sequence with initial period 2,3,1,0.at n=6A037751
- T(n,n-3), array T as in A038792.at n=41A038793
- Total area of all n-celled polyominoes.at n=8A057766
- Numbers k that divide 2^(k+3) - 1.at n=42A069927
- List of codewords in binary lexicode with Hamming distance 7 written as decimal numbers.at n=10A075937
- Expansion of chi(q)^3 / chi(q^3) in powers of q where chi() is a Ramanujan theta function.at n=41A132972
- Triangle, read by rows, that transforms diagonals in the table of coefficients in the successive iterations of x+x^2 (cf. A122888).at n=50A135080
- Triangle read by rows: expansion of p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n - 3)*Sum[Binomial[n, m]*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=57A146767
- Number of permutations of 2 indistinguishable copies of 1..n arranged in a circle with exactly 6 adjacent element pairs in decreasing order.at n=2A151587
- a(1)=0, a(n) = n^3 - a(n-1).at n=27A153026
- Numbers k such that the sum of the prime distinct divisors of k^2+1 equals 2 times the largest prime divisor of k^2+1.at n=4A200072
- The Wiener index of the graph obtained by applying Mycielski's construction to the cycle graph C(n).at n=38A228320
- a(n) = Sum_{i=0..n} digsum_8(i)^3, where digsum_8(i) = A053829(i).at n=40A231682
- Sum of squares of cycle lengths for different cycles in Fibonacci-like sequences modulo n.at n=28A233246
- Triangle T(n, k) = Numbers of ways to place k points on a triangular grid of side n so that no two of them are adjacent. Triangle read by rows.at n=26A239567
- Number of ways to place 5 points on a triangular grid of side n so that no two of them are adjacent.at n=4A239571
- Number of length 2+2 0..n arrays with the sum of second differences squared multiplied by some arrangement of +-1 equal to zero.at n=21A250321
- Molien series for invariants of finite Coxeter group A_8.at n=59A266777