Properties of the Number -15921

Fifteen Thousand Nine Hundred Twenty-One

Basics

Value: -15922 → -15921 → -15920

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 29 × 61

Divisors: 1, 3, 9, 29, 61, 87, 183, 261, 549, 1769

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -11111000110001

Octal: -37061

Duodecimal: -9269

Hexadecimal: -3e31

Square: 253478241

Square Root: 126.17844506887855

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 subsets of {1..n} containing no products of two or more distinct elements. A326117

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 0 0 vertically. A207960

n³+Largest square, (Largest square <= n³). A176580

Output of the linear congruential pseudo-random number generator rand() used in Microsoft's Visual C++. A96558

Expansion of -(3 - x + 2·x²) / (1 - x³ + x⁴). A110063

E.g.f. A(x) satisfies: A(x) = A(x²) * exp( Integral A(x²) dx ). A294785

Number of nX4 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 0 0 vertically. A207956

Number of 6Xn 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 0 0 vertically. A207964

Number of length n+2 0..2 arrays with some pair in every consecutive three terms totalling exactly 2. A245864

a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 2] as of [1, 3]. A211279