11056
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
- 1
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 21452
- Proper Divisor Sum (Aliquot Sum)
- 10396
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5520
- Möbius Function
- 0
- Radical
- 1382
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 2
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
- 130
- 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
- Reduced tangent numbers: 2^n*(2^{2n} - 1)*|B_{2n}|/n, where B_n = Bernoulli numbers.at n=5A002105
- Fermionic string states.at n=16A005309
- Number of achiral 2-connected planar maps with n edges.at n=12A006444
- Poupard's triangle: triangle of numbers arising in enumeration of binary trees.at n=25A008301
- Poupard's triangle: triangle of numbers arising in enumeration of binary trees.at n=35A008301
- Expansion of 1/((1-4x)(1-7x)(1-9x)(1-12x)).at n=3A028151
- Number of binary [ n,3 ] codes without 0 columns.at n=28A034344
- Number of 3 X 3 matrices with elements from [0,...,(n-1)] satisfying the condition that the middle element of each row or column is the difference of the two end elements (in absolute value).at n=11A058333
- McKay-Thompson series of class 20B for Monster.at n=21A058551
- a(n) = 10*n^2 + 5*n + 1.at n=33A080860
- Triangle of coefficients of a companion polynomial to the Gandhi polynomial.at n=15A083061
- Triangle T(n,k) read by rows given by [0, 1, 3, 6, 10, 15, 21, ...] DELTA [1, 3, 6, 10, 15, 21, 28,...] where DELTA is the operator defined in A084938.at n=20A087736
- Triangle T(n,k) read by rows given by [0, 1, 3, 6, 10, 15, 21, ...] DELTA [1, 3, 6, 10, 15, 21, 28,...] where DELTA is the operator defined in A084938.at n=22A087736
- Triangle read by rows: coefficients d(n,k) of André polynomials D(x,n) = Sum_{k>0} d(n,k)*x^k.at n=35A094503
- Triangle read by rows: coefficients d(n,k) of André polynomials D(x,n) = Sum_{k>0} d(n,k)*x^k.at n=29A094503
- Another version of triangular array in A083061: triangle T(n,k), 0<=k<=n, read by rows; given by [0, 1, 3, 6, 10, 15, 21, 28, ...] DELTA [1, 2, 3, 4, 5, 6, 7, 8, ...] where DELTA is the operator defined in A084938.at n=22A094665
- Triangle read by rows: T(n,k) = (k+1)*T(n-1,k) + (n-k+1)*T(n,k-1).at n=19A096078
- Triangle read by rows: T(n,k) = (k+1)*T(n-1,k) + (n-k+1)*T(n,k-1).at n=20A096078
- Numbers whose natural logarithm, in base 10, starts with 10 distinct digits.at n=3A113509
- Triangle read by rows: number of simsun n-permutations with k descents.at n=28A113897