Properties of the Number 5931

Five Thousand Nine Hundred Thirty-One

Basics

Value: 5930 → 5931 → 5932

Parity: odd

Prime: No

Previous Prime: 5927

Next Prime: 5939

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 659

Divisors: 1, 3, 9, 659, 1977, 5931

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 1011100101011

Octal: 13453

Duodecimal: 3523

Hexadecimal: 172b

Square: 35176761

Square Root: 77.01298591796062

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 partitions of n in which each part occurs an odd number (or zero) times. A55922

Coordination sequence for (2,3,8) tiling of hyperbolic plane. A265058

Numbers k such that k divides 1 + ∑_j=1..k prime(j)⁵ = 1 + A122103(k). A128169

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 and a(2) = a(3) = 2. A50045

T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 0, 1 or 3 neighboring 1s. A296578

Least k such that there are exactly n ways to choose a divisor of each prime index of k (taken in weakly increasing order) such that the result is also weakly increasing. A355736

Riordan array (1/(1-x·c(3·x)), x·c(3·x)/(1-x·c(3·x))), c(x) the g.f. of A000108. A110519

a(n) = 4·n*(n+1) + 3. A164897

a(1) = 7, a(n) = least k such that concatenation of n copies of k with all previous concatenation gives a prime. A111475

Total number of repeated parts in all partitions of n. A194452