Properties of the Number -87009

Eighty-Seven Thousand Nine

Basics

Value: -87010 → -87009 → -87008

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 13 × 23 × 97

Divisors: 1, 3, 13, 23, 39, 69, 97, 291, 299, 897

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10101001111100001

Octal: -251741

Duodecimal: -42429

Hexadecimal: -153e1

Square: 7570566081

Square Root: 294.9728801093416

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 n X k 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero. A316822

Numbers k such that k and k+1 have at least 4 but not both exactly 4 distinct prime factors. A321494

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

a(n) = (10n+1)*(10n+9). A1535

Number of nX3 0..1 arrays with every element equal to 0, 1 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero. A301879

Number of nX4 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero. A316818

Number of nX5 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero. A316819

Number of (n+6)X1 arrays of occupancy after each element moves up to +-6 places but not 0 and without 2-loops. A222164