Properties of the Number -88839

Eighty-Eight Thousand Eight Hundred Thirty-Nine

Basics

Value: -88840 → -88839 → -88838

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 36

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 9871

Divisors: 1, 3, 9, 9871, 29613, 88839

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10101101100000111

Octal: -255407

Duodecimal: -434B3

Hexadecimal: -15b07

Square: 7892367921

Square Root: 298.0587190471032

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

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to two. A205836

A triangular sequence of coefficients of polynomials: p(x,n)=(3*(x - 1)ⁿ*Sum[(((-1)ⁿ*(2·k + 1)^{n - 1}))*x^k, {k,0, Infinity}] -(x - 1)^{n + 1}*Sum[((-1)^{n + 1}*kⁿ)*x^k, {k, 0, Infinity}]/x)/2. A154337

Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 17. A31695

Number of (n+1) X 2 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to two. A205829

Number of (n+1)X8 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to two. A205835