Properties of the Number -19824

Nineteen Thousand Eight Hundred Twenty-Four

Basics

Value: -19825 → -19824 → -19823

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ⁴ × 3 × 7 × 59

Divisors: 1, 2, 3, 4, 6, 7, 8, 12, 14, 16

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100110101110000

Octal: -46560

Duodecimal: -B580

Hexadecimal: -4d70

Square: 392990976

Square Root: 140.79772725438434

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

Riordan array (-sqrt(4·x²+8·x+1)+2·x+2, (sqrt(4·x²+8·x+1)-2·x-1)/2). A121575

Sum of all parts of all partitions of n that do not contain 1 as a part. A138880

Irregular triangle read by rows: first row is 1, and the n-th row gives the coefficients in the expansion of (1/2·x)*(1 - 2·x*(1 - x))^{n + 1}*Li(-n, 2·x*(1 - x)), where Li(n, z) is the polylogarithm. A142147

Triangle read by rows: T(n,0) = 0 for n >= 0; T(n,2·k+1) = A152842(2·n,2*(n-k)) and T(n,2·k) = A152842(2·n,2*(n-k)+1) for n >= k > 0. A299989

Number of (12345, 13245, 21345, 23145, 31245, 32145)-avoiding permutations. A54872

Riordan array (2-2·x-sqrt(1-8·x+4·x²), (1-2·x-sqrt(1-8·x+4·x²))/2). A121576

Coordination sequence for F₄ lattice. A19558

Sum of parts in all partitions of 2n that do not contain 1 as a part. A182736

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of 2/(1 - 2·k*x + ((k-2)*x)² + (1 - k·x) * sqrt(1 - 2·k*x + ((k-2)*x)²)). A331791

Expansion of ((1 - 4·x)/sqrt(1 - 8·x + 4·x²) - 1)/(6·x²). A331792