11181
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14912
- Proper Divisor Sum (Aliquot Sum)
- 3731
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7452
- Möbius Function
- 1
- Radical
- 11181
- 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
- yes
- 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
- Number of triples of different integers from [ 2,n ] with no global factor.at n=43A015618
- Expansion of 1/((1-x)(1-5x)(1-8x)).at n=4A016233
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/2n} satisfy r < s, then r < k/m < (k+2)/m < s for some integer k.at n=45A024842
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 70.at n=32A031568
- Numbers having four 1's in base 10.at n=19A043496
- Row 5 of square array defined in A047662.at n=8A047661
- Near-repunit semiprimes.at n=26A105993
- Reversion of x*(1-x)*(1-x^2)*(1-x^3)/(1-x^6) = x*(1-x)^2/(1-x+x^2).at n=8A109081
- Triangle, read by rows, where column k of T = column 0 of matrix power T^{(k+1)(k+2)/2} for k>=0, with T(n,0)=1 for n>=0.at n=22A134523
- Column 1 of triangle T=A134523, also equals column 0 of the matrix power T^3, where column k of T = column 0 of matrix power T^{(k+1)(k+2)/2} for k>=0.at n=5A134524
- a(n) = 6*n^2 - 10*n + 5.at n=43A136392
- Inverse of Riordan array ((1-x)(1-x^2)(1-x^3)/(1-x^6), x(1-x)(1-x^2)(1-x^3)/(1-x^6)).at n=36A185967
- Number of 4 X n binary arrays without the pattern 0 1 diagonally, vertically, antidiagonally or horizontally.at n=23A188555
- Partial sums of A193911.at n=16A193912
- Numbers with digital product = 8.at n=38A199989
- Composite numbers whose product of digits is 8.at n=27A201056
- Numbers consisting of ones and eights.at n=32A213084
- Number of Motzkin n-paths avoiding odd-numbered steps that are up steps.at n=16A215067
- Number of (n+1)X(1+1) 0..3 arrays x(i,j) with row sums sum{j^2*x(i,j), j=1..1+1} nondecreasing, and column sums sum{i^2*x(i,j), i=1..n+1} nondecreasing.at n=3A232706
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays x(i,j) with row sums sum{j^2*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i^2*x(i,j), i=1..n+1} nondecreasing.at n=6A232708