11081
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12672
- Proper Divisor Sum (Aliquot Sum)
- 1591
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9492
- Möbius Function
- 1
- Radical
- 11081
- Omega Function (Ω)
- 2
- 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
- 68
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) is the solution to the postage stamp problem with 4 denominations and n stamps.at n=28A001209
- Number of fountains of n coins.at n=19A005169
- Sum of indices of windows of trapezoidal maps.at n=10A007872
- Numbers k such that the continued fraction for sqrt(k) has period 90.at n=22A020429
- a(n) = Sum_{k=1..n} binomial(k, n mod k).at n=19A072951
- Numbers k such that 7*10^k - 11 is prime.at n=16A102740
- Number of partitions of n with exactly one prime number.at n=42A132381
- Number of partitions of n such that the number of parts is divisible by the smallest part.at n=33A168657
- Number of partitions of n into terms of (1,3)-Ulam sequence, cf. A002859.at n=52A199118
- Number of (n+1)X2 0..5 arrays with the permanents of all 2X2 subblocks equal and nonzero.at n=2A204756
- Number of (n+1)X4 0..5 arrays with the permanents of all 2X2 subblocks equal and nonzero.at n=0A204758
- T(n,k)=Number of (n+1)X(k+1) 0..5 arrays with the permanents of all 2X2 subblocks equal and nonzero.at n=3A204763
- T(n,k)=Number of (n+1)X(k+1) 0..5 arrays with the permanents of all 2X2 subblocks equal and nonzero.at n=5A204763
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 1 0 vertically.at n=47A207305
- Number of 3 X n 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 1 0 vertically.at n=7A207306
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 1 0 and 1 0 1 vertically.at n=47A207918
- Number of partitions of n that have hookset {1,2,...,k} for some k.at n=53A228117
- O.g.f.: 1/(1 - C(1)x/(1 - C(2)x/(1 - C(3)x/(1 - C(4)x/(1 - C(5)x/(1 - C(6)x/(1 -...))))))), a continued fraction, where C(n) are the Catalan numbers A000108.at n=5A268646
- Numbers missing from A317415.at n=7A317417
- Numbers k such that both k and k+2 are de Polignac numbers (A006285).at n=12A330284