11693
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12768
- Proper Divisor Sum (Aliquot Sum)
- 1075
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10620
- Möbius Function
- 1
- Radical
- 11693
- 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
- 143
- 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
- Multiplicity of highest weight (or singular) vectors associated with character chi_21 of Monster module.at n=40A034409
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 16.at n=33A050965
- a(n)/n^2 is the minimal average squared Euclidean distance of n points to their center of gravity among all configurations of n points on the hexagonal lattice.at n=43A059518
- a(0)=0. a(n) = a(n-1) + sum of positive integers which are <= n and not part of the sequence.at n=42A129694
- a(n) = 8*n^2 + 20*n + 1.at n=37A161617
- Number of arrangements of n+1 numbers x(i) in -1..1 with the sum of x(i)*x(i+1) equal to zero.at n=8A188350
- T(n,k)=Number of arrangements of n+1 numbers x(i) in -k..k with the sum of x(i)*x(i+1) equal to zero.at n=44A188358
- Number of peakless Motzkin paths of length n having no (1,0)-steps at levels 1,3,5,... .at n=19A190168
- Numbers n such that n^2 + 1 is divisible by a 4th power.at n=38A218563
- O.g.f. satisfies: A(x) = Sum_{n>=0} (n+3)^n * x^n * A(n*x)^n/n! * exp(-(n+3)*x*A(n*x)).at n=5A221412
- Number of partitions of n such that 2*(least part) < number of parts.at n=33A237758
- Number of (n+1) X (1+1) 0..2 arrays with no 2 X 2 subblock having its minimum diagonal element less than its minimum antidiagonal element.at n=3A250920
- Number of (n+1)X(4+1) 0..2 arrays with no 2X2 subblock having its minimum diagonal element less than its minimum antidiagonal element.at n=0A250923
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with no 2X2 subblock having its minimum diagonal element less than its minimum antidiagonal element.at n=6A250927
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with no 2X2 subblock having its minimum diagonal element less than its minimum antidiagonal element.at n=9A250927
- Consider the 2^n values of A147562(i)/i^2 for 2^n <= i < 2^(n+1); a(n) = value of i where this quantity is minimized.at n=13A260239
- Number of integer partitions of n that can be partitioned into distinct pairs of (possibly equal) parts.at n=40A338916
- Number of integers k that are neither squarefree nor prime powers (in A126706) and that do not exceed primorial A002110(n).at n=6A380403