11705
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
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14052
- Proper Divisor Sum (Aliquot Sum)
- 2347
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9360
- Möbius Function
- 1
- Radical
- 11705
- 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
- Expansion of e.g.f. cos(x/cosh(x)) (even powers only).at n=4A009119
- Expansion of exp(x/cos(x)).at n=8A009300
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/2n} satisfy r < s, then r < k/m < (k+2)/m < s for some integer k.at n=46A024842
- Denominators of continued fraction convergents to sqrt(659).at n=6A042267
- a(n) = p(0) + p(1) + ... + p(n) - n - 1, where p = partition numbers, A000041.at n=26A058682
- Numbers k such that (phi(k-2) + phi(k+2))/2 = phi(k); 2-phi/balanced numbers.at n=22A099633
- a(n) = 8*n^2 + 4*n + 1.at n=38A102083
- Number of non-intersecting cycle systems in a particular directed graph.at n=8A112832
- Number of partitions of n into parts with at most one part not greater than 2.at n=45A121659
- a(n) = 6*n^2 - 10*n + 5.at n=44A136392
- Hypotenuse C of primitive Pythagorean triangles such that perimeters are Averages of twin prime pairs, q=p+1, a=q^2-p^2, c=q^2+p^2, b=2*p*q, s=a+b+c, s-+1 are primes.at n=10A155175
- Number of n X 8 array permutations with each element moving zero or one space horizontally or diagonally.at n=1A189448
- T(n,k)=Number of nXk array permutations with each element moving zero or one space horizontally or diagonally.at n=37A189449
- Number of 2 X n array permutations with each element moving zero or one space horizontally or diagonally.at n=7A189450
- Number of (w,x,y,z) with all terms in {1,...,n} and 3w = x + y + z + n + 1.at n=35A212251
- Numbers k^2 + (k+1)^2 that can be expressed as a sum of two squares in exactly one other way.at n=34A239527
- Number of n X 2 nonnegative integer arrays with upper left 0 and lower right n+2-4 and value increasing by 0 or 1 with every step right or down.at n=20A252870
- a(n) = 24*n^2 + 52*n + 29.at n=21A258721
- Bridging trails on square lattice.at n=10A259855
- a(n) = r*a(ceiling(n/2))+s*a(floor(n/2)) with a(1)=1 and (r,s)=(3,2).at n=49A268526