Properties of the Number 19098

Nineteen Thousand Ninety-Eight

Basics

Value: 19097 → 19098 → 19099

Parity: even

Prime: No

Previous Prime: 19087

Next Prime: 19121

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 1061

Divisors: 1, 2, 3, 6, 9, 18, 1061, 2122, 3183, 6366

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100101010011010

Octal: 45232

Duodecimal: B076

Hexadecimal: 4a9a

Square: 364733604

Square Root: 138.19551367537227

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(n) = 26 + 2ⁿ⁺¹*(-13 +9·n -3·n² +n³). A36827

a(1) = 0, a(2) = 1, and for n > 2, a(n) = 2·a(A252463(n)) + [n == 1 (mod 6)]. A292941

Coordination sequence for root lattice B₃. A22145

Third Lie-Betti number of a path graph on n vertices. A361230

a(n) = smallest non-palindromic k such that the Reverse and Add! trajectory of k is palindrome-free and joins the trajectory of A070788(n). A89494

a(n) = 2·a(n-1) - a(n-3) + a(floor(n/2)), where a(0) = 1, a(1) = 1, a(2) = 1. A298402

σ(n) + n is a square. A114069

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = ∑_j=0..n 2^j * j^k. A368479

a(n) = smallest non-palindromic number k such that the Reverse and Add! trajectory of k joins the trajectory of A089521(n). A89522

Number of distinct printable hexaflexagons of length n. A286111