Properties of the Number 19283

Nineteen Thousand Two Hundred Eighty-Three

Basics

Value: 19282 → 19283 → 19284

Parity: odd

Prime: No

Previous Prime: 19273

Next Prime: 19289

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 11 × 1753

Divisors: 1, 11, 1753, 19283

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100101101010011

Octal: 45523

Duodecimal: B1AB

Hexadecimal: 4b53

Square: 371834089

Square Root: 138.8632420765121

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

Number of lone-child-avoiding locally disjoint rooted trees whose leaves are integer partitions whose multiset union is an integer partition of n. A331678

T(n,k)=Number of nXk 0..n·k-1 arrays with upper left zero and lower right n·k-1 and each element differing from its horizontal, vertical and antidiagonal neighbors by a power of two. A265601

Numbers n for which the numbers 6n+1, 3n+2, 6n+7 are all odd composite squarefree numbers, but none are semiprimes. A263510

Numerators of continued fraction convergents to sqrt(781). A42506

Number of nX2 0..n·2-1 arrays with upper left zero and lower right n·2-1 and each element differing from its horizontal, vertical and antidiagonal neighbors by a power of two. A265595

Numbers k such that 45·2^k - 1 is prime. A2242

A triangle sequence derived from setting an Euler numbers A122045 generalization equal to the MacMahon numbers A060187 to get a generating function expansion: p(x,t) = (exp(t)* (1 - exp(x))* x)/(exp(2 t + t x) + exp(t)* x - exp(t·x)* x). A178234

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,6)-perfect numbers. A19283