9365
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11244
- Proper Divisor Sum (Aliquot Sum)
- 1879
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7488
- Möbius Function
- 1
- Radical
- 9365
- 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
- 60
- 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 simplices in barycentric subdivision of n-simplex.at n=6A002050
- Numbers k such that the continued fraction for sqrt(k) has period 29.at n=27A020368
- a(n) = [ (3rd elementary symmetric function of P(n))/(first elementary symmetric function of P(n)) ], where P(n) = {first n+2 primes}.at n=11A024453
- Numbers whose maximal base-8 run length is 4.at n=27A037995
- Numbers having four 2's in base 8.at n=12A043432
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 9.at n=15A051974
- Triangle T(n,k) (n >= 1, 0<=k<=n) giving number of preferential arrangements of n things beginning with k (transposed, then read by rows).at n=26A054255
- Number of representations of n as a sum of products of positive integers. 1 is not allowed as a factor, unless it is the only factor. Representations which differ only in the order of terms or factors are considered equivalent.at n=26A066739
- Sum of terms in n-th rows of triangle in A077159.at n=26A077162
- Row sums of A081964.at n=26A081966
- Triangle read by rows: T(n,k) = number of preferential arrangements of n things where the first object has rank k.at n=22A090665
- n times n+7 gives the concatenation of two numbers m and m+4.at n=3A116319
- Start with 1027 and repeatedly reverse the digits and add 16 to get the next term.at n=16A119455
- Numbers k such that 2*k+1, 3*k+2 and 4*k+3 are primes.at n=38A126955
- Triangle, read by rows, of coefficients of q^(nk+k) in the q-analog of the odd double factorials: T(n,k) = [q^(nk+k)] Product_{j=1..n+1} (1-q^(2j-1))/(1-q) for n>0, with T(0,0)=1.at n=37A128592
- Triangle, read by rows, of coefficients of q^(nk+k) in the q-analog of the odd double factorials: T(n,k) = [q^(nk+k)] Product_{j=1..n+1} (1-q^(2j-1))/(1-q) for n>0, with T(0,0)=1.at n=43A128592
- Column 1 of triangle A128592; a(n) = coefficient of q^(n+2) in the q-analog of the odd double factorials (2n+3)!! for n>=0.at n=7A128593
- Numbers k such that 2*k+1, 3*k+2, 4*k+3 and 5*k+4 are primes.at n=11A138700
- a(1)=2, a(2)=5, a(n)=2*a(n-1) + 5*a(n-2).at n=7A189734
- Number of 0..n arrays x(0..4) of 5 elements with each no smaller than the sum of its previous elements modulo (n+1).at n=8A200254