ℕ atory
Play Now

Properties of the Number -5856

Eight Hundred Fifty-Six

Basics

Value: -5857 → -5856 → -5855

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 5 × 3 × 61

Divisors: 1, 2, 3, 4, 6, 8, 12, 16, 24, 32

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1011011100000

Octal: -13340

Duodecimal: -3480

Hexadecimal: -16e0

Square: 34292736

Square Root: 76.52450587883597

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

Triangle of numbers obtained by inverting infinite matrix defined in A059369, read from right to left. A59370
Expansion of ( (1 + 8·x)/(1 - x) )1/3. A372024
Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m·k + 1)*T(n-1, k, m) + m·f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = 2k if k <= floor(n/2) otherwise 2n-k, and m = 1, read by rows. A157268
Number of subsets of {1...n} containing no prime indices of the elements. A324741
Number T(n,k) of permutations of [n] with exactly k (possibly overlapping) occurrences of the consecutive pattern 1324; triangle T(n,k), n>=0, 0<=k<=max(0,floor(n/2-1)), read by rows. A264173
Numbers k such that σ(x) = k has exactly 6 solutions. A60662
Products of the 5th power of a prime and 2 distinct primes (p5*q·r). A179667
T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 0 1 1 vertically. A207368
T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 1 1 1 vertically. A207693
Triangle read by rows: T(n, k) = t(n-k, k), where t(0,0) = 1, t(n,m) = 0 if n < 0 or m < 0, else t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), and f(n) = 5·n + 2. A257614