11765
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15288
- Proper Divisor Sum (Aliquot Sum)
- 3523
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8640
- Möbius Function
- -1
- Radical
- 11765
- 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
- 50
- 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
- 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+4)/m < s for some integer k.at n=35A024848
- Numbers k such that 273*2^k + 1 is prime.at n=39A053353
- a(n) = T(n,n-5), array T as in A055801.at n=33A055805
- When expressed in base 2 and then interpreted in base 7, is a multiple of the original number.at n=33A062848
- Trajectory of 3 under map n->7n-1 if n odd, n->n/2 if n even.at n=26A063871
- Sieve performed by successive iterations of steps where step m is: keep m terms, remove the next 3 and repeat; as m = 1,2,3,.. the remaining terms form this sequence.at n=16A112561
- Sum of the heights of all directed column-convex polyominoes of area n; here by the height of a polyomino one means the number of lines of slope -1 that pass through the centers of the polyomino cells.at n=8A121299
- Triangle t(n,k) read by rows: fibonomial ratios c(n)/(c(k)*c(n-k)) where c are partial products of a generalized Fibonacci sequence with multiplier m=4.at n=30A172349
- Triangle t(n,k) read by rows: fibonomial ratios c(n)/(c(k)*c(n-k)) where c are partial products of a generalized Fibonacci sequence with multiplier m=4.at n=33A172349
- Number of permutations of length n which avoid the patterns 321 and 1324.at n=17A179257
- Number of parts that are visible in one of the three views of the shell model of partitions version "Tree" with n shells.at n=30A194803
- Non-crossing, non-nesting, 4-colored set partitions.at n=5A225030
- Erroneous version of A002469.at n=7A260782
- Numbers n that are the product of three distinct odd primes and x^2 + y^2 = n has integer solutions.at n=41A264498
- Number of (undirected) paths in the n-gear graph.at n=9A292000
- a(n) is the least k such that A295520(k) = n.at n=38A295793
- Sum of the largest parts of the partitions of n into 4 parts.at n=42A308760
- Final elements in rows when A322050 is displayed as a triangle.at n=11A322048
- Numbers k such that (Sum of totatives of k) == 1 (mod Sum of primes dividing k with multiplicity).at n=26A340299
- Successive records of function f(x) = log(abs(pi(x) - R(x)))/log(x) where pi(x) is the number of primes <= x and R(x) is Riemann's prime counting function.at n=31A353055