Properties of the Number -88831

Eighty-Eight Thousand Eight Hundred Thirty-One

Basics

Value: -88832 → -88831 → -88830

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 211 × 421

Divisors: 1, 211, 421, 88831

Polygonal

Triangular: Yes

Square: No

Pentagonal: No

Hexagonal: Yes

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10101101011111111

Octal: -255377

Duodecimal: -434A7

Hexadecimal: -15aff

Square: 7890946561

Square Root: 298.0452985705361

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

Numbers of the form p·q, p and q prime with q=2·p-1. A129521

Triangular numbers which are the product of two primes. A68443

Strong pseudoprimes to base 7. A20233

Composite numbers k such that k divides F(k-1) where F(j) are the Fibonacci numbers. A69106

Odd numbers with increasing numbers of bases to which they are strong pseudoprimes. A141768

Strong pseudoprimes to base 11. A20237

Numbers to which Mersenne primes 2^p-1 can be congruent mod k! (for k > 1). A145038

Odd numbers > 1, not powers of primes, for which A326147(n) is equal to abs(A326146(n)). A326148

Super pseudoprimes (or superpseudoprimes) to base 3: Fermat pseudoprimes to base 3 all of whose divisors that are larger than 1 are either primes or Fermat pseudoprimes to base 3. A328662

Numbers m such that exactly half of the a such that 0<a<m and (a,m)=1 satisfy a^m-1 == 1 (mod m). A191311