Properties of the Number -29461

Twenty-Nine Thousand Four Hundred Sixty-One

Basics

Value: -29462 → -29461 → -29460

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 17 × 1733

Divisors: 1, 17, 1733, 29461

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111001100010101

Octal: -71425

Duodecimal: -15071

Hexadecimal: -7315

Square: 867950521

Square Root: 171.64206943520577

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 length-(n+1) 0..k arrays with new repeated values introduced in sequential order starting with zero. A268261

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of e.g.f.: exp(∏_j=1..n 1/(1-x^j) - 1). A294212

E.g.f.: exp(1/((1-x)*(1-x²)*(1-x³)*(1-x⁴)) - 1). A294215

Numbers n such that n·2²²⁰³ - 1 is prime. A265503

Number of length-(n+1) 0..4 arrays with new repeated values introduced in sequential order starting with zero. A268257

Number of length-(6+1) 0..n arrays with new repeated values introduced in sequential order starting with zero. A268265

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, 0), (0, 1, -1), (1, 0, -1), (1, 0, 1)}. A149319