Properties of the Number 19290

Nineteen Thousand Two Hundred Ninety

Basics

Value: 19289 → 19290 → 19291

Parity: even

Prime: No

Previous Prime: 19289

Next Prime: 19301

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 5 × 643

Divisors: 1, 2, 3, 5, 6, 10, 15, 30, 643, 1286

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100101101011010

Octal: 45532

Duodecimal: B1B6

Hexadecimal: 4b5a

Square: 372104100

Square Root: 138.88844444373333

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

Numbers n such that σ(n) is a Fibonacci number. A272412

Numbers k such that k·3^k + 1 is prime. A6552

G.f.: A(x) = exp( ∑_n>=1 G_n(xⁿ)² * xⁿ/n ) such that G_n(xⁿ) = ∏_k=0..n-1 A(u^k*x) where u is an n-th root of unity. A203266

Numbers whose natural logarithm, in base 10, starts with 10 distinct digits. A113509

Numbers k such that Bernoulli number B_k has denominator 14322. A295588

a(n) is the least k such that σ(k) is a Fibonacci number when k is the product of n distinct primes, or 0 if no such k exists. A290936

Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k·n; sequence gives the (2,13)-perfect numbers. A19290

Numbers k such that σ(σ(k)) is a Fibonacci number. A280545