Properties of the Number 19293

Nineteen Thousand Two Hundred Ninety-Three

Basics

Value: 19292 → 19293 → 19294

Parity: odd

Prime: No

Previous Prime: 19289

Next Prime: 19301

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 59 × 109

Divisors: 1, 3, 59, 109, 177, 327, 6431, 19293

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100101101011101

Octal: 45535

Duodecimal: B1B9

Hexadecimal: 4b5d

Square: 372219849

Square Root: 138.8992440584181

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

E.g.f. satisfies A(x) = exp( 3·x*A(x) ) / (1-x). A361182

Pair the odd numbers such that the k-th pair is (r, r+2k) where r is the smallest odd number not included earlier: (1, 3), (5, 9), (7, 13), (11, 19), (15, 25), (17, 29), (21, 35), (23, 39), (27, 45), ... This is the sequence of the product of the members of pairs. A75320

a(1) = 3; a(n) = smallest number such that the forward as well as the reverse n-th partial concatenation is a prime for n>1. A83993

Right-truncatable happy numbers: every prefix is a happy number and no digits are zero. A383638

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 (4,k)-perfect numbers. A19293