11185
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13428
- Proper Divisor Sum (Aliquot Sum)
- 2243
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8944
- Möbius Function
- 1
- Radical
- 11185
- 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) = floor(n(n-1)(n-2)(n-3)/19).at n=23A011929
- Numbers k such that the continued fraction for sqrt(k) has period 63.at n=17A020402
- Number of rooted unlabeled trees on n nodes having a primary branch.at n=12A027415
- Number of connected functions on n points with a loop of length 2.at n=12A027852
- Triangle of the numbers of different forests with m rooted trees having distinct orders.at n=79A106236
- Number of 5-almost primes less than or equal to 10^n.at n=5A114453
- The number of n-almost primes less than or equal to 10^n, starting with a(0)=1.at n=5A116430
- Triangle read by rows: CP(n,i) for n>=0 and 3n+1 >= i >= 0, gives the absolute value of the coefficients of the chromatic polynomial of C_3 X P_(n+1) factored in the form x(x-1)^i.at n=35A123531
- Triangle read by rows: T(k,n) is number of numbers <= 10^n that are products of k primes.at n=35A126280
- Expansion of g.f.: 1/((1 - x - x^2 + x^4 - x^6)*(1 - x^2 + x^4 + x^5 - x^6)).at n=23A147606
- Number of compositions of n such that the number of parts and the largest part and the smallest part are pairwise not coprime.at n=24A199891
- Number of rooted unlabeled trees where the root node has degree 2 and both branches are distinct.at n=13A217420
- Total number of parts of multiplicity 4 in all partitions of n.at n=37A222704
- Define g(k) = min(n: n >= 0, 2^n + k prime). Then a(n) = min(odd k: g(k) = n).at n=34A260350
- a(n) = Sum_{k = 1..n} (k^n - n^k).at n=5A264748
- Harary index of the n X n black bishop graph.at n=19A296198
- Harary index of the n X n white bishop graph.at n=18A296200
- a(n) = number of isogeny classes of abelian surfaces over the finite field of order prime(n).at n=26A362198
- Indices where the cumulative sum of cos(2k+1)^(2k+1) reaches a record low value.at n=20A389560