Properties of the Number -591

Five Hundred Ninety-One

Basics

Value: -592 → -591 → -590

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 197

Divisors: 1, 3, 197, 591

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1001001111

Octal: -1117

Duodecimal: -413

Hexadecimal: -24f

Square: 349281

Square Root: 24.310491562286437

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

a(1) = -1, for n > 1, a(n) = ∑_{d∣n, d<n} A340197(n/d) * a(d). A340140

Expansion of c(q) * c(q⁶) / c(q²)² in powers of q where c() is a cubic AGM θ function. A122830

G.f. ∑_n=-oo..+oo (xⁿ - x)ⁿ⁺¹. A378582

Matrix inverse of triangle A096651; transforms n-dimensional partitions into (n-1)-dimensional partitions. A96874

Expansion of c(q³) / (c(q³) + c(q⁶)) where c() is a cubic AGM function. A145977

Let F(x) = 1 + 1·x + 4·x² + 10·x³ + ..., the g.f. for A000293 (solid partitions), and write F(x) = 1/∏_n>=1 E(n)^a(n) where E(n) = ∏_k>=n (1 - x^n·k). A193718

Inverse Euler transform of Thue-Morse sequence A001285. A316149

Expansion of ∑_k>=1 (-1)^k+1*k·x^k/(1 - k·x^k). A308366

Number of balanced partitions of n: the largest part equals the number of parts. A47993

Number of partitions of n into distinct parts >= 2. A25147