Properties of the Number -28971

Twenty-Eight Thousand Nine Hundred Seventy-One

Basics

Value: -28972 → -28971 → -28970

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 29 × 37

Divisors: 1, 3, 9, 27, 29, 37, 87, 111, 261, 333

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -111000100101011

Octal: -70453

Duodecimal: -14923

Hexadecimal: -712b

Square: 839318841

Square Root: 170.2086954300514

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 1 horizontally, diagonally or antidiagonally adjacent to 0 or 2 neighboring 1s. A297457

a(n) = 2^n-1 + 2^[ n/2 ] + 2^[ (n-1)/2 ] - F(n+3). A5674

Number of edges in an equilateral triangle "frame" of size n (see Comments in A328526 for definition). A333030

Niven numbers (A005349) with a record gap to the next Niven number. A337076

a(n) is the smallest k > 0 such that the first n multiples of k have the same sum of digits, but (n+1)k has a different one. a(n)=0 if no such k exists. A238088

Number of n X 3 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 0 or 2 neighboring 1s. A297452

Number of 7Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 0 or 2 neighboring 1s. A297463

Largest eigenvalue, rounded to the nearest integer, of a rank n matrix of 1..n² filled successively along antidiagonals (A069480). A72332