Properties of the Number 19314

Nineteen Thousand Three Hundred Fourteen

Basics

Value: 19313 → 19314 → 19315

Parity: even

Prime: No

Previous Prime: 19309

Next Prime: 19319

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 29 × 37

Divisors: 1, 2, 3, 6, 9, 18, 29, 37, 58, 74

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100101101110010

Octal: 45562

Duodecimal: B216

Hexadecimal: 4b72

Square: 373030596

Square Root: 138.97481786280562

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

Numbers k such that the coefficient of x^k in the expansion of ∏_j>=1 (1 - x^j)⁵ is zero. A302057

a(n) is the number of canonical polygons with 4n edges having 4-fold rotational symmetry. A307426

Number of partitions of n having (sum of odd parts) < (sum of even parts). A239259

Number of partitions of n having (sum of odd parts) <= (sum of even parts). A239260

a(n) = ∑_k=2..n binomial(k,2) * floor(n/k). A366967

Number of partitions of n with equal number of parts congruent to each of 0 and 4 (mod 5). A35555

Hyper-Wiener index of a benzenoid consisting of a chain of n hexagons characterized by the encoding s = 1133 (see the Gutman et al. reference, Sec. 5). A193400

Number of prime factors in A052129(n). A238496

Sequence defined by the recurrence formula a(n+1)=sum(a(p)*a(n-p)+k,p=0..n)+l for n>=1, with here a(0)=1, a(1)=1, k=0 and l=-2. A176753

Square array read by antidiagonals: T(n,m) (n>=1, m>=0) is the number of partitions of mn that are the sum of m not necessarily distinct partitions of n. A213086