11365
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13644
- Proper Divisor Sum (Aliquot Sum)
- 2279
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9088
- Möbius Function
- 1
- Radical
- 11365
- 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
- 81
- 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( n*(n-1)*(n-2)/19 ).at n=61A011901
- Numbers k such that the continued fraction for sqrt(k) has period 85.at n=9A020424
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 6.at n=39A031419
- Numbers n such that sum of squares of even digits of n equals sum of squares of odd digits of n.at n=5A076164
- Number of (w,x,y,z) with all terms in {1,...,n} and 3w=x+y+z+n.at n=30A212247
- Values of n such that L(20) and N(20) are both prime, where L(k) = (n^2+n+1)*2^(2*k) + (2*n+1)*2^k + 1, N(k) = (n^2+n+1)*2^k + n.at n=25A227523
- a(n) is the greatest integer k such that k/Fibonacci(n) < e.at n=19A293674
- a(n) is the integer k that minimizes |e - k/Fibonacci(n)|.at n=19A293676
- Number of nX3 0..1 arrays with every element unequal to 1, 2, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=9A316171
- Number of partitions of n with up to eight distinct kinds of 1.at n=19A320695
- G.f. A(x) satisfies A(x) = 1/A(-x*A(x)) such that [x^(2*n-1)] A(x)^n = 0 for n >= 2, with A(0) = A'(0) = 1.at n=9A377250