9395
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11280
- Proper Divisor Sum (Aliquot Sum)
- 1885
- 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
- 7512
- Möbius Function
- 1
- Radical
- 9395
- 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
- 109
- 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
- Numerators of continued fraction convergents to sqrt(498).at n=3A041950
- Number of solutions to the equation p_i = (1+mod(i,2))*p_{i-1} +- p_{i-2} +- p_{i-3} +- ... +- 2 +- 1, where p_i is the i-th prime number (where p_1 = 2 and the "zeroth prime" p_0 is defined to be 1).at n=21A059871
- a(n) = sum of n-th column in array in A100452.at n=21A100454
- Maximal number of squares of side 1 in an ellipse of semiaxes n,2n.at n=38A108126
- Start with 1057 and repeatedly reverse the digits and add 2 to get the next term.at n=38A120215
- Zero followed by partial sums of A008865.at n=30A145067
- a(n) = 324n - 1.at n=28A158306
- 1/4 the number of (n+1) X 2 0..3 arrays with no 2 X 2 subblock having sum 6.at n=2A183794
- 1/4 the number of (n+1)X4 0..3 arrays with no 2X2 subblock having sum 6.at n=0A183796
- T(n,k) = 1/4 the number of (n+1) X (k+1) 0..3 arrays with no 2 X 2 subblock having sum 6.at n=3A183802
- T(n,k) = 1/4 the number of (n+1) X (k+1) 0..3 arrays with no 2 X 2 subblock having sum 6.at n=5A183802
- Number of -n..n arrays x(0..5) of 6 elements with zero sum and no two consecutive declines, no adjacent equal elements, and no element more than one greater than the previous (random base sawtooth pattern).at n=37A200184
- A bisection of A183168.at n=32A215933
- Smallest m such that A070965(m) = -n.at n=41A227954
- Expansion of Sum_{i>=1} mu(i)^2*x^i / (1 - Sum_{j>=1} mu(j)^2*x^j)^2, where mu() is the Moebius function (A008683).at n=11A281812
- Partial sums of A019565.at n=44A288570
- Indices of primes followed by a gap (distance to next larger prime) of 42.at n=18A320719
- Sum of the second largest parts s of the partitions of n into 4 parts q,r,s,t such that 1 <= q <= r <= s <= t and q + r + s > t.at n=52A340248
- a(0) = ... = a(3) = 1; a(n) = a(n-4) + Sum_{k=0..n-5} a(k) * a(n-k-5).at n=26A343305
- Numbers with all digits odd whose squares have only one odd digit.at n=31A343727