Properties of the Number 19282

Nineteen Thousand Two Hundred Eighty-Two

Basics

Value: 19281 → 19282 → 19283

Parity: even

Prime: No

Previous Prime: 19273

Next Prime: 19289

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 31 × 311

Divisors: 1, 2, 31, 62, 311, 622, 9641, 19282

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100101101010010

Octal: 45522

Duodecimal: B1AA

Hexadecimal: 4b52

Square: 371795524

Square Root: 138.85964136494087

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

Expansion of ψ(q²) / f(-q)² in powers of q where ψ(), f() are Ramanujan θ functions. A137829

a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0, |s(i) - s(i-1)| = 1 for i = 1,2; |s(i) - s(i-1)| <= 1 for i >= 3, s(n) = 3. Also a(n) = T(n,n-3), where T is the array defined in A024996. A26070

Number of length-n binary strings that neither begin nor end with a square. A323442

a(n) = ∑_k=0..2n-3 T(n,k) * T(n,k+3), with T given by A025177. A27260

(Number of 4 X 4 pandiagonal magic squares with distinct positive entries less than n)/384. A317252

Numbers that do not occur as results of "upward" remultiplication (GF(2)[X] -> N) of any number; numbers not present in A234742. A236844

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,4)-perfect numbers. A19282

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