Properties of the Number 19895

Nineteen Thousand Eight Hundred Ninety-Five

Basics

Value: 19894 → 19895 → 19896

Parity: odd

Prime: No

Previous Prime: 19891

Next Prime: 19913

Digit Sum: 32

Digital Root: 5

Palindrome: No

Factorization: 5 × 23 × 173

Divisors: 1, 5, 23, 115, 173, 865, 3979, 19895

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100110110110111

Octal: 46667

Duodecimal: B61B

Hexadecimal: 4db7

Square: 395811025

Square Root: 141.0496366532009

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

Trajectory of n under the Reverse and Add! operation carried out in base 3 (presumably) does not reach a palindrome and (presumably) does not join the trajectory of any term m < n. A77405

E.g.f. A(x) satisfies A(x) = exp(-x·A(x)²) + x·A(x)². A379868

Odd multiplicative orders of 2+-i modulo primes p == 3 (mod 4). A385217

Multiplicative orders of 2+-i modulo p == 3 (mod 4) that are not divisible by 2 or 3. A385219

Pseudo-random numbers: MS C 6.0 version. A84275

Integers arising in A133677. A133645

A triangular sequence of coefficients of polynomials: p(x,n) = (2*(x - 1)ⁿ * (∑_k>=0 (((-1)ⁿ*(2·k + 1)^{n - 1}))*x^k) - (x - 1)^{n + 1}*(∑_k>=0 ((-1)^{n + 1}*kⁿ)*x^k)/x). A154335

Multiples of 23 whose digit reversal + 1 is also a multiple of 23. A166393

On a diagonally numbered square grid, with labels starting at 1, this is the number of steps that a (1,n) leaper makes before getting trapped when moving to the lowest available unvisited square, or -1 if it never gets trapped. A352730

Partial sums of A160414. A161325