Properties of the Number 19404

Nineteen Thousand Four Hundred Four

Basics

Value: 19403 → 19404 → 19405

Parity: even

Prime: No

Previous Prime: 19403

Next Prime: 19417

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 7 ² × 11

Divisors: 1, 2, 3, 4, 6, 7, 9, 11, 12, 14

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100101111001100

Octal: 45714

Duodecimal: B290

Hexadecimal: 4bcc

Square: 376515216

Square Root: 139.2982411949268

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

Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan triangle. A1263

a(n) = (2·n)!*(2·n+1)! / (n! * (n+1)!)². A891

Exponential abundant numbers: integers k for which A126164(k) > k, or equivalently for which A051377(k) > 2k. A129575

Number of antichains (or order ideals) in the poset 5·m*n or plane partitions with not more than m rows, n columns and entries <= 5. A56941

a(n) is the number of n-step walks on square lattice such that 0 <= y <= x at each step. A5558

Number A(n,k) of Dyck paths of semilength n having exactly six (possibly overlapping) occurrences of the consecutive step pattern given by the binary expansion of k, where 1=U=(1,1) and 0=D=(1,-1); square array A(n,k), n>=0, k>=0, read by antidiagonals. A243832

Triangle read by rows of the numbers T(n,k) (n > 1, 0 < k < n) of set partitions of n of length k which do not have a proper subset of parts with a union equal to a subset {1,2,...,j} with j < n. A87903

Square array T(n,k) read by antidiagonals: number of tilings of an <n,k,n> hexagon. A103905

Number of partitions into one kind of 1's, two kinds of 2's, and three kinds of 3's. A2597

a(n) = (n+1)*(n+2)²*(n+3)²*(n+4)²*(n+5)²*(n+6)/86400. A108679