Properties of the Number -187891

One Hundred Eighty-Seven Thousand Eight Hundred Ninety-One

Basics

Value: -187892 → -187891 → -187890

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 34

Digital Root: 7

Palindrome: No

Factorization: 11 × 19 × 29 × 31

Divisors: 1, 11, 19, 29, 31, 209, 319, 341, 551, 589

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -101101110111110011

Octal: -556763

Duodecimal: -90897

Hexadecimal: -2ddf3

Square: 35303027881

Square Root: 433.4639546721273

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

a(n) = smallest k having at least four prime divisors d such that (d + n) | (k + n). A202159

a(n) is the smallest nonnegative integer k where exactly n solutions to x² + 3·x*y + y² = k with 0 < x < y. A374095

Sum of the heights of the base pyramids in all dispersed Dyck paths of length n (i.e., in all Motzkin paths of length n with no (1,0)-steps at positive heights). A base pyramid is a factor of the form U^j D^j (j>0), starting at the horizontal axis. Here U=(1,1) and D=(1,-1). A191396

Squarefree terms of A129802 whose prime factors are neither elite (A102742) nor anti-elite (A128852), where A129802 is the possible bases for Pepin's primality test for Fermat numbers. A372895

Smallest k such that k can be written in exactly n ways as x² + 3·x*y + y² with 0 <= x <= y. A374275