Properties of the Number 19852

Nineteen Thousand Eight Hundred Fifty-Two

Basics

Value: 19851 → 19852 → 19853

Parity: even

Prime: No

Previous Prime: 19843

Next Prime: 19853

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 7 × 709

Divisors: 1, 2, 4, 7, 14, 28, 709, 1418, 2836, 4963

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100110110001100

Octal: 46614

Duodecimal: B5A4

Hexadecimal: 4d8c

Square: 394101904

Square Root: 140.89712559168834

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

Square array of coefficients in the successive iterations of x·C(x) = (1-sqrt(1-4·x))/2 where C(x) is the g.f. of the Catalan numbers (A000108); read by antidiagonals. A158825

Main diagonal in the array A158825 of coefficients of successive iterations of x·C(x), where C(x) is the Catalan function (A000108). A158832

Number of compositions (ordered partitions) of n into heptagonal numbers (A000566). A322799

Number of ordered trees with n edges and having no root-to-leaf branches. A82989

Numbers k such that the product of the digits of k is equal to the sum of the prime factors of k, counted with multiplicity. A65774

Write 0, 1, ..., n in base 3 and add as if they were decimal numbers. A121718

Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k pyramids. A94322

Numbers n such that d(n-2) = d(n) = d(n+2) = 12 where d(n)=A000005(n). A190645

Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n and having sum of pyramid heights equal to k. A94449

Ulam numbers k such that 4·k and 16·k are also Ulam numbers. A287634