Properties of the Number -5944

Nine Hundred Forty-Four

Basics

Value: -5945 → -5944 → -5943

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ³ × 743

Divisors: 1, 2, 4, 8, 743, 1486, 2972, 5944

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1011100111000

Octal: -13470

Duodecimal: -3534

Hexadecimal: -1738

Square: 35331136

Square Root: 77.09734106958553

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

Define an array as follows: b(i,0)=b(0,j)=1, b(i,j) = 2·b(i-1,j-1) + b(i-1,j) + b(i,j-1). Then a(n) = b(n,n). A69835

Pascal-(1,2,1) array read by antidiagonals. A81577

Generalized Stirling numbers, [n+5,5]_4. A1716

Generalized Stirling number triangle of first kind read by rows: T(n, k) = [x^k] ∏_m=1..n (x - m - r), with r = 3. A49459

Number of binary vectors of length n+1 beginning with 0 and containing just 1 singleton. A6367

Triangle generated by the asymptotic expansions of the E(x,m=2,n). A165674

Triangle read by rows. T(n, k) = (n - k + 1)! * H(k, n - k), where H are the hyperharmonic numbers. For 0 <= k <= n. A165675

T(n,k)=Number of nXk 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A279741

Square array read by descending antidiagonals: T(n, k) where column k is the expansion of 1/sqrt(1 - 2*(k+1)*x + ((k-1)*x)²). A307883

Number of (directed) Hamiltonian paths in the n-ladder graph. A137882