Properties of the Number -18859

Eighteen Thousand Eight Hundred Fifty-Nine

Basics

Value: -18860 → -18859 → -18858

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 18859

Divisors: 1, 18859

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -100100110101011

Octal: -44653

Duodecimal: -AAB7

Hexadecimal: -49ab

Square: 355661881

Square Root: 137.3280743329637

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

Indices of records of minimal distance between successive Riemann ζ zeros. A326502

Write product of first n primes as x·y with x<y and·maximal; sequence gives value of y-x. A61060

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)-x(i-1,j) in the j direction. A250527

Primes p such that p1 = ceiling(p/2) + p is prime and p2 = floor(p1/2) + p1 is prime. A158714

Hard numbers: a(n) = smallest positive number m with f(m) = n, where f(m) is the smallest number of digits that are needed to construct m using only 1's, 2's and any number of +, -, *, ^ signs, not allowing concatenation of the digits. A60274

Primes with digit sum = 31. A106767

Primes congruent to 32 mod 67. A154621

Number of lines through at least 2 points of a 9 X n grid of points. A160849

Smallest number requiring n digits for its representation in the "Terrible Twos Problem" without using multidigit expressions. A260016

Primes p such that (p+2)/3 and (p+3)/2 are prime. A338410