Properties of the Number 19281

Nineteen Thousand Two Hundred Eighty-One

Basics

Value: 19280 → 19281 → 19282

Parity: odd

Prime: No

Previous Prime: 19273

Next Prime: 19289

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 6427

Divisors: 1, 3, 6427, 19281

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 100101101010001

Octal: 45521

Duodecimal: B1A9

Hexadecimal: 4b51

Square: 371756961

Square Root: 138.8560405599987

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

Semiprimes in A056108. A113527

a(n) = 12·n² + 2·n + 1. A194454

Number of (w,x,y,z) with all terms in {1,...,n} and 2w=x+y+z. A212068

Expansion of 1/(1-x³-x⁴-x⁵-x⁶). A17819

Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 72 ones. A31840

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 425", based on the 5-celled von Neumann neighborhood. A272091

a(n) = ∑_{k=0..floor(n/2)} A027157(n-k, k). A27167

Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 92. A31590

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,3)-perfect numbers. A19281

a(n) = smallest k such that there is no square between prime(k) and prime(k+n). A224699