Properties of the Number -28861

Twenty-Eight Thousand Eight Hundred Sixty-One

Basics

Value: -28862 → -28861 → -28860

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 7 ² × 19 × 31

Divisors: 1, 7, 19, 31, 49, 133, 217, 589, 931, 1519

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -111000010111101

Octal: -70275

Duodecimal: -14851

Hexadecimal: -70bd

Square: 832957321

Square Root: 169.88525539316237

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

q-factorial numbers 3!_q. A69778

Least number k such that lcm{1,2,...,k}/denominator of harmonic number H(k) = 2n-1. A112822

Number of ways to write n as an ordered sum of 7 primes. A340963

a(n) = n*(n² + 2·n - 1)/2. A127736

Square array T(n, k) = ∏_j=1..n ( ∑_i=0..j-1 ((k+1)² - (k+1))ⁱ ) with T(n, 0) = n!, read by antidiagonals. A156881

Triangle of numbers of inequivalent Boolean functions of n variables with exactly k nonzero values (atoms) under action of complementing group. A54724

The number of P-positions in the game of Nim with up to 4 piles, allowing for piles of zero, such that the number of objects in each pile does not exceed n. A241522

p(p²-p+1) as p runs through the primes. A83558

Number of Pythagorean quadruples mod n; i.e., number of solutions to w² + x² + y² = z² mod n. A96018

a(n) = ∑_i=0..n digsum₈(i)⁴, where digsum₈(i) = A053829(i). A231683