Properties of the Number -36991

Thirty-Six Thousand Nine Hundred Ninety-One

Basics

Value: -36992 → -36991 → -36990

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 71 × 521

Divisors: 1, 71, 521, 36991

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1001000001111111

Octal: -110177

Duodecimal: -194A7

Hexadecimal: -907f

Square: 1368334081

Square Root: 192.33044480788786

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

Sum of the fifth largest parts of the partitions of n into 9 parts. A326469

a(n) = 32·n² - 1. A158563

Numbers k such that 5·10^k - 3 is prime. A103003

a(n) = n³ - 2·n² - 1. A214731

Strong pseudoprimes to base 25. A20251

A triangle sequence derived from setting an Euler numbers A122045 generalization equal to the Eulerian numbers A008292 to get a generating function expansion: p(x,t) = ((-1 + exp(x)) (-1 + x)/(-1 + exp(t·x) + t - exp(t)* x)). A178232

Number of 5Xn 0..1 arrays with every element equal to 0, 1, 3 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302430

a(1) = 0 and a(n+1) > a(n) is the smallest integer such that a(n+1)²-a(n)² is triangular. A358416

Reverse of smallest prime factor of k = largest prime factor of k+1; a(1)=1. A71392

Reversal of base-n digits of largest prime < n³. A329931