11165
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
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 17280
- Proper Divisor Sum (Aliquot Sum)
- 6115
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6720
- Möbius Function
- 1
- Radical
- 11165
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- Number of n-bead necklaces with 5 colors.at n=7A001869
- Positive numbers k such that k and 5*k are anagrams in base 8 (written in base 8).at n=5A023076
- Number of partitions of n that do not contain 7 as a part.at n=35A027341
- Numbers in which 0,1,2,3,4,5 all occur in base 6.at n=32A031947
- Digitally balanced numbers in base 6: equal numbers of 0's, 1's, ..., 5's.at n=32A049357
- Number of ways to color vertices of a heptagon using <= n colors, allowing only rotations.at n=5A054621
- Triangle read by rows: row n (n >= 1) contains the numbers T(n,k) = Sum_{d|n} phi(d)*k^(n/d)/n, for k=1..n.at n=25A054631
- McKay-Thompson series of class 21C for the Monster group.at n=22A058565
- Composite numbers k with no prime factor among (2, 3) (cf. A038509) and such that phi(k) < 2*k/3.at n=32A069043
- Jablonski table T(n,k) read by antidiagonals: T(n,k) = number of necklaces with n beads of k colors.at n=61A075195
- Nondescending wiggly sums: number of sums adding to n in which terms alternately do not decrease and do not increase.at n=18A129852
- Smallest order of the cyclotomic polynomial whose maximal coefficient in absolute value is n.at n=11A136418
- Table read by antidiagonals: T(n,k) = number of distinct n X k toroidal 0..4 arrays.at n=21A184288
- Table read by antidiagonals: T(n,k) = number of distinct n X k toroidal 0..4 arrays.at n=27A184288
- Numbers n not divisible by 2 or 3 such that k^k == k+1 (mod n) has no nonzero solutions.at n=48A191834
- Number of (w,x,y,z) with all terms in {1,...,n} and 2*w*x>=3*y*z.at n=13A211923
- Numbers n, written in base 8, with the property that if the base-8 representation of n is read backwards, the result is 5*n.at n=1A223089
- The Wiener index of the graph obtained by applying Mycielski's construction to the crown graph G(n) (n>=3).at n=26A228598
- The least k such that the polynomial cyclotomic(k,x) has n different coefficients.at n=23A231611
- Occurrences of decrease of the probability density P(n) of coprime numbers k,m, satisfying 1 <= k <= a(n) and 1 <= m <= a(n), and a(n) congruent to 1 (mod 2) and a(n) not congruent to 3 (mod 6).at n=7A280879