Properties of the Number -95305

Ninety-Five Thousand Three Hundred Five

Basics

Value: -95306 → -95305 → -95304

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 5 × 7 ² × 389

Divisors: 1, 5, 7, 35, 49, 245, 389, 1945, 2723, 13615

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10111010001001001

Octal: -272111

Duodecimal: -471A1

Hexadecimal: -17449

Square: 9083043025

Square Root: 308.71507899679926

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

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 3, 4, 5 or 7 king-move adjacent elements, with upper left element zero. A299128

Numbers n such that 8·9ⁿ - 1 is prime. A268356

a(n) = 66·n² + 1. A158689

a(n) = n*(n + 1)*(13·n² + 13·n - 14)/24. A264888

Expansion of ∑_{p prime, i>=1} x^pⁱ/(1 - x^pⁱ) / ∏_{p prime, j>=1} (1 - x^{p^j}). A281616

Number of nX4 0..1 arrays with every element equal to 0, 1, 3, 4, 5 or 7 king-move adjacent elements, with upper left element zero. A299124

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 1), (1, -1, -1), (1, 1, -1), (1, 1, 1)}. A149629

Let P be a one-move "rider" with move set M={(1,2)}; a(n) is the number of non-attacking positions of two indistinguishable pieces P on an n X n board. A222308