11362
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 20160
- Proper Divisor Sum (Aliquot Sum)
- 8798
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4752
- Möbius Function
- 1
- Radical
- 11362
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 81
- 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
- Representation degeneracies for Ramond strings.at n=20A005303
- a(n) = n*(n+1)*(n+8)/6.at n=38A006503
- a(n) = floor( n*(n-1)*(n-2)/22 ).at n=64A011904
- Numerators of continued fraction convergents to sqrt(969).at n=7A042874
- Number of Hamiltonian paths in the graph on n vertices {1,...,n}, with i adjacent to j iff |i-j| <= 2.at n=22A069241
- Number of permutations of length n which avoid the patterns 2314, 2431, 3124.at n=8A116751
- Multiples of 13 containing a 13 in their decimal representation.at n=30A121033
- a(n) = n*(8*n-5).at n=38A139272
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (0, 1, 1), (1, -1, 0), (1, 1, -1)}.at n=8A149050
- a(n) = 4394*n - 1820.at n=2A156627
- Multiples of 23 whose digit reversal + 1 is also a multiple of 23.at n=18A166393
- Number of (n+2)X3 binary arrays avoiding patterns 001 and 111 in rows and columns.at n=6A202371
- Number of (n+2)X9 binary arrays avoiding patterns 001 and 111 in rows and columns.at n=0A202377
- T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 001 and 111 in rows and columns.at n=21A202378
- T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 001 and 111 in rows and columns.at n=27A202378
- G.f.: exp( Sum_{n>=1} 2*Pell(n)^4 * x^n/n ), where Pell(n) = A000129(n).at n=4A208055
- Number of partitions p of n such that median(p) <= multiplicity(min(p)).at n=36A240213
- Nonprimes such that it takes exactly 3 iterations of reverse-and-add digits to generate a prime.at n=26A245208
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 353", based on the 5-celled von Neumann neighborhood.at n=26A271307
- Expansion of Product_{k>=1} 1/(1+x^k)^((-1)^k*k^2).at n=16A307484