Properties of the Number -2859

Eight Hundred Fifty-Nine

Basics

Value: -2860 → -2859 → -2858

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 953

Divisors: 1, 3, 953, 2859

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -101100101011

Octal: -5453

Duodecimal: -17A3

Hexadecimal: -b2b

Square: 8173881

Square Root: 53.4696175411794

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

First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 137", based on the 5-celled von Neumann neighborhood. A270277

First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 497", based on the 5-celled von Neumann neighborhood. A272559

Expansion of ∏_k>0 (1 - 2·k*x^2·k)/(1 + (2·k-1)*x^2·k-1). A319860

Number of partitions of n into distinct parts such that number of parts is odd. A67659

Number of partitions of n into distinct parts such that number of parts is even. A67661

Numbers n such that (n⁹⁷-1)/(n-1) is prime. A217089

Number of strict odd-length integer partitions of 2n. A344650

Number of partitions of n into distinct parts, the greatest being odd. A26837

Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 3·x, p(n,x) = u·p(n-1,x) + v·p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - x - x². A367208

a(n) = 2·C(n) - 1, where C(n) = A000108(n) are the Catalan numbers. A131428