Properties of the Number 5911

Five Thousand Nine Hundred Eleven

Basics

Value: 5910 → 5911 → 5912

Parity: odd

Prime: No

Previous Prime: 5903

Next Prime: 5923

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

4823 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

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

Boustrophedon transform of primes. A747

Smallest odd number expressible in at least n ways as p+2·m² where p is 1 or a prime and m >= 0. A7697

Consider all ways of writing a number as p+2m² where p is 1 or a prime and m >= 0; sequence gives numbers that are expressible in at least 2 more ways than any smaller number. A16067

G.f.: ∏_k>=1 1/(1-x^k)^2·k+3. A255802

Matrix inverse of triangle A136590. A136595