Properties of the Number -19409

Nineteen Thousand Four Hundred Nine

Basics

Value: -19410 → -19409 → -19408

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 13 × 1493

Divisors: 1, 13, 1493, 19409

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100101111010001

Octal: -45721

Duodecimal: -B295

Hexadecimal: -4bd1

Square: 376709281

Square Root: 139.31618714277246

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

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) + b(n-2), where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4. A294414

Expansion of ∏_k>=1 (1 - x^8·k)/(1 - x^k). A261775

Least b > p_n² such that [p₁²,p₂²,...,p_n²] in base b is prime, where p_j denotes the j-th prime. A224197

a(n) = A030067(2ⁿ + 2^n-1 - 1) for n>=1, where A030067 gives the semi-Fibonacci numbers. A129094

a(n) = A030068(4n+3). A169740

Number of edges in a polygon whose boundary consists of n+2 equally spaced points around a semicircle and n+2 equally spaced points along the diameter (a total of 2n+2 points). See Comments for precise definition. A334459

n(k) is the minimum number that require at least k to make Prime[n]+2·Prime[n+k] a prime. A114264

a(n) = (2·n³ + 5·n² + 11·n)/2. A162263

Expansion of 1 / (1 - x - x² + x³ - x⁵ + x¹⁵ - x¹⁷ - x¹⁸ + x¹⁹ + x²⁰). A174650

Expansion of e.g.f. arctanh(sec(x) * log(x+1)). A12777