11405
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13692
- Proper Divisor Sum (Aliquot Sum)
- 2287
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9120
- Möbius Function
- 1
- Radical
- 11405
- 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
- 29
- 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
- Number of ordered quadruples of integers from [ 1..n ] with no global factor.at n=21A015634
- Interprimes which are of the form s*prime, s=5.at n=26A075280
- G.f.: exp( Sum_{n>=1} (x^n/n) / Product_{d|n} (1 - d*x^n)^d ).at n=16A205488
- Numbers k such that (265*10^k + 17)/3 is prime.at n=24A272523
- Number of nX3 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 or 2 neighboring 1s.at n=5A297501
- T(n,k)=Number of nXk 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 or 2 neighboring 1s.at n=33A297506
- Number of 6Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 or 2 neighboring 1s.at n=2A297511
- Number of nX3 0..1 arrays with every element equal to 2, 3 or 5 king-move adjacent elements, with upper left element zero.at n=13A297871
- Numbers k such that 3^k - k + 1 is prime.at n=8A308829
- Expansion of 1/(1 - x) * Product_{k>=0} 1/(1 - x^(4^k))^(4^(k+1)).at n=11A321345
- Numbers k such that A338338(k) is a prime p that ends a run of three terms in A338338 that are divisible by p.at n=33A338344
- Numbers in A231626 but not in A343302; first of 5 consecutive deficient numbers in arithmetic progression with common difference > 1.at n=23A343303
- Let e(m) be the sum of all values of k satisfying the equation: (m mod k = floor((m - k)/k) mod k), minus 2*m (1 <= k <= m); then a(n) is the smallest m for which e(m) = n, or 0 if no e(m) has value n.at n=34A374870