Properties of the Number -5811

Eight Hundred Eleven

Basics

Value: -5812 → -5811 → -5810

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 13 × 149

Divisors: 1, 3, 13, 39, 149, 447, 1937, 5811

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1011010110011

Octal: -13263

Duodecimal: -3443

Hexadecimal: -16b3

Square: 33767721

Square Root: 76.2299153875957

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 read by rows: T(n,k) (n>=1; 1<=k<=n) is the number of permutations of [n] in which the longest increasing run has length k. A8304

Growth series for affine Coxeter group B₁₂. A267175

Number of representations of n as a sum of products of distinct pairs of positive integers, considered to be equivalent when terms or factors are reordered. A211856

a(n) = 4 + floor(∑_k=1..n-1 a(k) / 2). A120134

a(n) = a(n-1) + a(m) for n >= 4, where m = 2^p+1 + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1, a(2) = 3, and a(3) = 1. A50057

Growth series for affine Coxeter group (or affine Weyl group) D₁₂. A266767

a(n) = ∑_d∣n d·prime(d). A61150

Number of permutations of [n] in which the longest increasing run has length 4. A434

MM-numbers of labeled graphs with half-loops covering an initial interval of positive integers, without isolated vertices. A340018

Number of partitions of n into 8 distinct and relatively prime parts. A340719