11148
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
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 26040
- Proper Divisor Sum (Aliquot Sum)
- 14892
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3712
- Möbius Function
- 0
- Radical
- 5574
- 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
- 37
- 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
- Pisot sequence T(7,10), a(n) = floor(a(n-1)^2/a(n-2)).at n=36A020752
- Geometric mean of digits = 2 and digits are in nondecreasing order.at n=10A069512
- Expansion of (1-x)/(1-x+2*x^2+2*x^3).at n=18A078022
- Quintisection and binomial transform of 1/(1-x^4-x^5).at n=14A099131
- Molecular topological indices of the path graphs P_n.at n=25A121318
- Self-convolution cube of A073711.at n=22A194279
- Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths incorporating each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 5, n >= 2.at n=32A214563
- Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths incorporating each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 6, n >= 2.at n=23A214601
- Number of nXnXn triangular 0..2 arrays with every horizontal row nondecreasing, first elements of rows nonincreasing, last elements of rows nondecreasing, and every row having the same average value.at n=9A215176
- Number of n X 6 binary arrays with top left value 1 and no two ones adjacent horizontally, diagonally or antidiagonally.at n=3A228658
- T(n,k)=Number of nXk binary arrays with top left value 1 and no two ones adjacent horizontally, diagonally or antidiagonally.at n=39A228660
- Number of 4 X n binary arrays with top left value 1 and no two ones adjacent horizontally, diagonally or antidiagonally.at n=5A228663
- Number of tilings of a 5 X n rectangle using n pentominoes of shapes P, U, X.at n=13A278330
- E.g.f.: exp(Sum_{n>=1} A000009(n-1)*x^n/n).at n=7A293906
- Numbers with digits in nondecreasing order such that additive and multiplicative digital roots coincide.at n=38A318273
- Number of compositions of n with weakly increasing first quotients.at n=39A342492
- a(n) = Sum_{1 <= x_1 <= x_2 <= x_3 <= x_4 <= n} gcd(x_1, x_2, x_3 , x_4, n).at n=20A343518
- a(n) = Sum_{k=1..floor(n/2)} sigma_k(n-k), where sigma_k(n) is the sum of the k-th powers of the divisors of n.at n=10A343781
- Triangle read by rows: T(n,k) is the number of unlabeled connected multigraphs with n edges on k nodes and degree >= 3 at each node, loops allowed, n >= 2, 1 <= k <= floor(2*n/3).at n=51A360862
- a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) + a(n-5) with a(1) = a(2) = a(3) = 0, a(4) = 1, and a(5) = 3.at n=18A385142