Properties of the Number -5831

Eight Hundred Thirty-One

Basics

Value: -5832 → -5831 → -5830

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 7 ³ × 17

Divisors: 1, 7, 17, 49, 119, 343, 833, 5831

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1011011000111

Octal: -13307

Duodecimal: -345B

Hexadecimal: -16c7

Square: 34000561

Square Root: 76.36098480245

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) = 1 - n³. A24001

a(n) = n³ - 1. A68601

Numbers k such that k, k + 1 and k + 2 are 3 consecutive Harshad numbers. A154701

Numbers k such that k and k+1 are both base φ Niven numbers (A334308). A334309

Array read by descending antidiagonals: A(n,k) is the number of unoriented colorings of the edges of a regular n-dimensional simplex using up to k colors. A327084

Table T(n,k) giving number of k-multigraphs on n nodes (n >= 1, k >= 0) read by antidiagonals. A63841

Array read by antidiagonals, m>=0, n>=0, A(m,n) = ∑_k=0..n ∑_j=0..m ∑_i=0..m (-1)^j+i*C(i,j)*C(n,k)^m+1*(n+1)^j*(k+1)^-j. A198060

T(n,k)=Number of length n+1 0..k arrays with the sum of adjacent differences multiplied by some arrangement of +-1 equal to zero. A250167

Sum of the seventh largest parts of the partitions of n into 10 squarefree parts. A326631

Numbers of the form i·9^j-1 (i=1..8, j >= 0). A140576