Properties of the Number -2842

Eight Hundred Forty-Two

Basics

Value: -2843 → -2842 → -2841

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 7 ² × 29

Divisors: 1, 2, 7, 14, 29, 49, 58, 98, 203, 406

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -101100011010

Octal: -5432

Duodecimal: -178A

Hexadecimal: -b1a

Square: 8076964

Square Root: 53.31041174104736

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) = -(n - 4)*(n - 5)*(n - 12)/6. A167541

Expansion of ∏_k>=1 (1-x^k)²⁹. A10834

A symmetrical triangle of polynomial coefficients that are von Koch like: b=1/4; p(x, n) = If[Mod[n, 4] == 2, (b·x - n/2)*p(x, n - 1), If[ Mod[n, 4] == 3, (x/2 - b·n + 1/2)*p(x, n - 1), If[ Mod[n, 4] == 0, (-b·x - n/2 + b)*p(x, n - 1), (x/2 + b·n)*p(x, n - 1)]]]; q(x,n)=(p(x,n)+xⁿ*(p(1/x,n))/bⁿ. A155688

Number of partitions of n into parts >= 3. A8483

Number of superdiagonal bargraphs with area n. A219282

Number of partitions of n in which the least part is 3. A26796

Goodstein sequence starting with 4: to calculate a(n+1), write a(n) in the hereditary representation in base n+2, then bump the base to n+3, then subtract 1. A56193

a(n) = n*(n + 9). A28569

Triangle T(n,k) read by rows giving number of labeled mappings (or functional digraphs) from n points to themselves (endofunctions) with exactly k cycles, k=1..n. A60281

7 times triangular numbers: 7·n*(n+1)/2. A24966