Properties of the Number -9305

Three Hundred Five

Basics

Value: -9306 → -9305 → -9304

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 5 × 1861

Divisors: 1, 5, 1861, 9305

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10010001011001

Octal: -22131

Duodecimal: -5475

Hexadecimal: -2459

Square: 86583025

Square Root: 96.46242791885346

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Coefficients of the '6th-order' mock θ function 2 μ(q). A53273

Determinant of the (p_n-1)/2 X (p_n-1)/2 matrix with (i,j)-entry being the Legendre symbol ((j-i)/p_n), where p_n is the n-th prime. A228077

Values of n such that L(6) and N(6) are both prime, where L(k) = (n²+n+1)*2^2·k + (2·n+1)*2^k + 1, N(k) = (n²+n+1)*2^k + n. A226926

Triangle T(n,k) read by rows: T(n,k) is the number of length-n ascent sequences with exactly k descents. A238858

Triangle read by rows: T(n,k) is the number of primitive (aperiodic) word structures of length n using exactly k different symbols. A137651

Let p(n) be the n-th prime congruent to 1 mod 4. Then a(n) = the least k for which m²+1=p(n)*k² has a solution. A94049

T(n,k)=Number of length (n+k)X1 arrays of occupancy after each element moves up to +-k places but not 0 and without 2-loops. A222165

Numbers k such that continued fraction of (1 + sqrt(k))/2 has period 11. A146335

Coefficients of xⁿ, n >= 0, in A(x) such that: x = ∑_n=-oo..+oo (-x)ⁿ * (1 - (-x)ⁿ)ⁿ * A(x)ⁿ. A357399

Number of primitive (aperiodic) word structures of length n which contain exactly three different symbols. A56279