Properties of the Number -531

Five Hundred Thirty-One

Basics

Value: -532 → -531 → -530

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 59

Divisors: 1, 3, 9, 59, 177, 531

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1000010011

Octal: -1023

Duodecimal: -383

Hexadecimal: -213

Square: 281961

Square Root: 23.043437243605826

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

Infinite square array read by antidiagonals: Q(m, 0) = 1, Q(m, 1) = 1; Q(m, 2k) = (m - 2k + 1)*Q(m+1, 2k-1) - (2k-1)*Q(m+2,2k-2), m·Q(m, 2k+1) = (m - 2k)*Q(m+1, 2k) - 2k(m+1)*Q(m+2, 2k-1). A127080

Define an array by Q(m, 0) = 1, Q(m, 1) = 1; Q(m, 2k) = (m - 2k + 1)*Q(m+1, 2k-1) - (2k-1)*Q(m+2, 2k-2), m·Q(m, 2k+1) = (m - 2k)*Q(m+1, 2k) - 2k(m+1)*Q(m+2, 2k-1). Sequence gives Q(0,n). A127137

Poly-Cauchy numbers of the second kind hat c_n^-4. A223902

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

a(n) = A325977(A228058(n)). A389217

Expansion of f(-x³)³ / (f(-x²) * f(-x⁴)²) in powers of·where f() is a Ramanujan θ function. A262150

Expansion of ∑_k>0 (1/(1+x^k)³ - 1). A363630

a(2,n) as defined in A003148. A84543

A weighted count of the number of overpartitions of n with restricted odd differences. A261035

Expansion of (1-q)^k/∏_j=1..k (1-q^j) for k=8. A275642