Properties of the Number 19385

Nineteen Thousand Three Hundred Eighty-Five

Basics

Value: 19384 → 19385 → 19386

Parity: odd

Prime: No

Previous Prime: 19381

Next Prime: 19387

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 5 × 3877

Divisors: 1, 5, 3877, 19385

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100101110111001

Octal: 45671

Duodecimal: B275

Hexadecimal: 4bb9

Square: 375778225

Square Root: 139.2300254973761

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

T(n,k) = Number of n X k 0..1 arrays with the number of 1's horizontally, diagonally or antidiagonally adjacent to some 0 equal to the number of 0's adjacent to some 1, with top left element zero. A284334

5th power of rooted tree enumerator; number of linear forests of 5 rooted trees. A343

Number of 4-bead necklaces labeled with numbers -n..n allowing reversal, with sum zero with no three beads in a row equal. A209345

Numbers n such that the Collatz iterations for n and n + 1 have the same length (A078417) but do not meet a certain condition. (See comments.) A274410

Numbers k such that the continued fraction for sqrt(k) has period 49. A20388

Number of n X 3 0..1 arrays with the number of 1's horizontally, diagonally or antidiagonally adjacent to some 0 equal to the number of 0's adjacent to some 1, with top left element zero. A284329

Number of 6 X n 0..1 arrays with the number of 1's horizontally, diagonally or antidiagonally adjacent to some 0 equal to the number of 0's adjacent to some 1, with top left element zero. A284339

Decimal expansion of π/sqrt(3) = sqrt(2*ζ(2)). A93602

No-3-in-line problem: number of inequivalent ways of placing 2n points on an n X n grid so that no 3 are in a line. A769

T(n,k) = number of ways to arrange k indistinguishable points on an n X n X n triangular grid so that no three points are collinear at any angle. A194136