Properties of the Number -5911

Nine Hundred Eleven

Basics

Value: -5912 → -5911 → -5910

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 23 × 257

Divisors: 1, 23, 257, 5911

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1011100010111

Octal: -13427

Duodecimal: -3507

Hexadecimal: -1717

Square: 34939921

Square Root: 76.8830280361017

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, matrix inverse of A124733, companion to A123965. A126124

Numerators of the Maclaurin coefficients of exp(1/x - 1/(exp(x)-1) - 1/2). A321937

Triangle T(n,k), read by rows, defined by T(n,k)=3·T(n-1,k)-T(n-1,k-1)-T(n-2,k), T(0,0)=1, T(1,0)=2, T(1,1)=-1, T(n,k)=0 if k<0 or if k>n. A123971

McKay-Thompson series of class 30a for Monster. A58619

First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 401", based on the 5-celled von Neumann neighborhood. A271806

Expansion of (1-x)/(1 - 3·x + x²)². A1870

Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 3·x, p(n,x) = u·p(n-1,x) + v·p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - x - x². A367208

Number of integer partitions of n whose sum of primes of parts is divisible by n. A331379

a(n) = (A114043(n) - 1)/2. A115005

Number of forests of rooted trees with total weight n, where a node at height k has weight 2^k (with root considered to be at height 0). A115593