Properties of the Number 5909

Five Thousand Nine Hundred Nine

Basics

Value: 5908 → 5909 → 5910

Parity: odd

Prime: No

Previous Prime: 5903

Next Prime: 5923

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 19 × 311

Divisors: 1, 19, 311, 5909

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1011100010101

Octal: 13425

Duodecimal: 3505

Hexadecimal: 1715

Square: 34916281

Square Root: 76.87002016391045

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

Number of strict non-knapsack integer partitions of n, meaning not every subset has a different sum. A316402

Number of symmetric plane partitions of n. A5987

T(n,k)=Number of nXk 0..2 arrays with no element equal to any value at offset (-2,-1) (-1,1) or (0,-1) and new values introduced in order 0..2. A276299

Triangle read by rows: T(n,k) (n>=0, 0<=k<=n) = number of partitions of n with exactly k kinds of 1's which are introduced in ascending order. A292746

Number of odd terms in fⁿ, where f = x⁴*y⁴ + x⁴*y³ + x³*y⁴ + x⁴*y² + x²*y⁴ + x⁴*y + x³*y² + x²*y³ + x·y⁴ + x⁴ + x²*y² + y⁴ + x³ + x²*y + x·y² + y³ + x² + y² + x + y + 1. A246034

Let p = n-th prime == 3 mod 4; a(n) = (sum of quadratic nonresidues mod p) - (sum of quadratic residues mod p). A282037

(Sum of the quadratic nonresidues of prime(n)) - (sum of the quadratic residues of prime(n)). A282038

a(n) = ∑_k=1..n k² * floor(n/k)². A350123

a(1) = 2, and for n>1: a(n) = prime(A251719(n)) * prime(A251719(n) + n - 2), where prime(n) gives the n-th prime. A251724

Number of toothpicks after n stages of 3-D toothpick structure defined in Comments. A170876