11795
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16224
- Proper Divisor Sum (Aliquot Sum)
- 4429
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8064
- Möbius Function
- -1
- Radical
- 11795
- Omega Function (Ω)
- 3
- 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
- 81
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Numbers m such that 2^m + m is prime.at n=16A052007
- An Alexander sequence for the knot 6_3.at n=16A099447
- Composite numbers q such that 2^q + q is prime.at n=10A100556
- Number of partitions of n in which some but not all parts are equal.at n=34A167930
- Number of lobsters with n nodes that are not caterpillars.at n=13A186308
- Triangular array read by rows: T(n,k) is the number of functional digraphs on {1,2,...,n} such that every element is mapped to a recurrent element and there are exactly k cycles, n>=1, 1<=k<=n.at n=24A228534
- Number of partitions p of n such that m(p) = m(c(p)), where m = maximal multiplicity of parts, and c = conjugate.at n=47A240728
- Number of (n+1)X(3+1) 0..1 arrays with every 2X2 subblock sum nondecreasing horizontally, vertically and antidiagonally ne-to-sw.at n=5A253321
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with every 2X2 subblock sum nondecreasing horizontally, vertically and antidiagonally ne-to-sw.at n=33A253326
- Number of (6+1)X(n+1) 0..1 arrays with every 2X2 subblock sum nondecreasing horizontally, vertically and antidiagonally ne-to-sw.at n=2A253331
- Sums of seven consecutive squares: a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2 + (n+4)^2 + (n+5)^2 + (n+6)^2.at n=41A260637
- Numbers with 3 prime factors a < b < c such that 2c = a^4 + b^2.at n=2A261657
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 438", based on the 5-celled von Neumann neighborhood.at n=29A272219
- Partial sums of A294016.at n=36A294017
- G.f.: 1 = Sum_{n>=0} a(n) * x^n / (1 + x*(1+x)^n)^(n+1).at n=8A337849
- a(n+1) = 1 + Sum_{k=1..n} a(gcd(n,k)).at n=48A346114
- a(1) = 4, and for any n > 1, a(n+1) is the a(n)-th squarefree number.at n=19A356398