Properties of the Number 19010

Nineteen Thousand Ten

Basics

Value: 19009 → 19010 → 19011

Parity: even

Prime: No

Previous Prime: 19009

Next Prime: 19013

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 × 1901

Divisors: 1, 2, 5, 10, 1901, 3802, 9505, 19010

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100101001000010

Octal: 45102

Duodecimal: B002

Hexadecimal: 4a42

Square: 361380100

Square Root: 137.87675656179326

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

Triangle T read by rows: T(m,n) = number of convex polyominoes with an m+1 X n+1 minimal bounding rectangle, m > 0, n <= m. A93118

(p·q - 1)/2 where p and q are consecutive odd primes. A102770

Numbers k such that 6·p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)*p(k+5)-1 and 6·p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)*p(k+5)+1 are twin primes with p(h) = h-th prime. A129311

G.f. A(x) satisfies A(x) = 1 + x·A(x/(1 - x)⁴) / (1 - x). A351814

Nonnegative integers k such that the Chebyshev distance between the vector of proportions of the digits 0-9 in 2^k and the uniform distribution (1/10, ..., 1/10) sets a new minimum. A393333

Number of convex polyominoes with an n+1 X n+1 minimal bounding square. A93120

a(n) = number of distinct values of ∏_i=1..r x_i!*i!^x_i, where (x₁, ..., x_r) is an r-tuple of nonnegative integers with ∑_i=1..r i·x_i = n. A102465

Number of (w,x,y,z) with all terms in {0,...,n} and (least gapsize)<2. A212896

Number of -n..n arrays x(0..3) of 4 elements with zero sum and nonzero second and third differences. A200205

G.f. satisfies: A(x) = 1 + x·A(x) / ( A(I·x)*A(-I·x) ). A216683