11741
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12000
- Proper Divisor Sum (Aliquot Sum)
- 259
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11484
- Möbius Function
- 1
- Radical
- 11741
- 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
- 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
- a(n) = floor(Gamma(n+2/11)/Gamma(2/11)).at n=9A020058
- a(n) = Sum_{k=0..floor(n/2)} A027144(n-k, k).at n=16A027154
- Sort-then-add sequence: a(n+1) = a(n) + sort(a(n)).at n=17A033860
- Sort then Add, a(1)=25.at n=13A033902
- Sort then Add, a(1)=32.at n=12A033907
- Multiplicity of highest weight (or singular) vectors associated with character chi_156 of Monster module.at n=40A034544
- Number of partitions of n with equal nonzero number of parts congruent to each of 1 and 2 (mod 4).at n=48A035549
- a(n) = T(6,n), array T given by A048505.at n=7A048511
- Surround numbers of a length 2n zig-zag.at n=30A060641
- Number of (n+1)X(2+1) 0..2 arrays x(i,j) with row sums sum{x(i,j), j=1..2+1} nondecreasing, and column sums sum{i*x(i,j), i=1..n+1} nondecreasing.at n=2A233115
- T(n,k) = Number of (n+1) X (k+1) 0..2 arrays x(i,j) with row sums Sum_{j=1..k+1} x(i,j) nondecreasing, and column sums Sum_{i=1..n+1} i*x(i,j) nondecreasing.at n=8A233117
- Number of (3+1)X(n+1) 0..2 arrays x(i,j) with row sums sum{x(i,j), j=1..n+1} nondecreasing, and column sums sum{i*x(i,j), i=1..3+1} nondecreasing.at n=1A233120