11397
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15840
- Proper Divisor Sum (Aliquot Sum)
- 4443
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7280
- Möbius Function
- -1
- Radical
- 11397
- 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
- 68
- 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
- Second pentagonal numbers with odd index: a(n) = (2*n-1)*(3*n-1).at n=44A033568
- Multiplicity of highest weight (or singular) vectors associated with character chi_64 of Monster module.at n=38A034452
- Positive numbers whose product of digits is 9 times their sum.at n=28A062041
- a(n) is the (n+1)st (n+2)-gonal number.at n=28A064808
- Minimal k > n such that (4k+3n)(4n+3k) is a square.at n=28A083752
- Indices of primes in sequence defined by A(0) = 79, A(n) = 10*A(n-1) - 71 for n > 0.at n=11A101132
- Odd numbers n such that there exists a solution to lcm(s,z-s) = n, lcm(t,z-t) = n-2 and 0 < s+t < z < n.at n=37A108157
- a(n) = 8*n^2 - 4*n - 3.at n=37A118057
- Integers arising in A133677.at n=17A133645
- Last term where no prime sums occur in A161190 in a 4-diagonal set of 24 terms.at n=3A161193
- a(n) = 4*n^2 + 3*n + 2.at n=53A185669
- Left edge of the triangle A045975.at n=28A204556
- Odd indices n for which A046825(n) is not larger than A046825(n-1).at n=36A214453
- Number of 2Xn 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=16A240793
- 30-gonal numbers: a(n) = n*(14*n-13).at n=29A254474
- Expansion of (1 + x - x^2 - x^3 - x^4)/((1 - x)*(1 - x - 2*x^2 - 2*x^3 - x^4)).at n=11A272362
- Number of series-reduced powerful rooted trees with n nodes.at n=54A318611
- a(n) = n*(n + 5)*(n + 7)/6 + 1.at n=37A323221