Properties of the Number 19415

Nineteen Thousand Four Hundred Fifteen

Basics

Value: 19414 → 19415 → 19416

Parity: odd

Prime: No

Previous Prime: 19403

Next Prime: 19417

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 5 × 11 × 353

Divisors: 1, 5, 11, 55, 353, 1765, 3883, 19415

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100101111010111

Octal: 45727

Duodecimal: B29B

Hexadecimal: 4bd7

Square: 376942225

Square Root: 139.33771922921662

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

Nonprimes in the triangle A141020. A141031

Partial sums of squares of Catalan numbers (A000108). A94639

G.f.: A(x) = exp( ∑_n>=1 A056045(n)/n·xⁿ ), where A056045(n) = ∑_d∣n binomial(n,d). A110448

Number of partitions of n into parts of 10 kinds. A23009

Number of dispersed Dyck paths of length n having no ascents of length 1. A191385

Numbers k such that (RSA-768) + 10^k is prime where RSA-768 is the 232 decimal digit RSA challenge number A391940(21). A113928

Number of n X 2 arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 n X 2 array. A219572

a(0) = 1, a(n) + a(n+1) = round(2ⁿ/9), n >= 0. A348405

a(0)=1, a(n) = M(n) + ∑_k=1..n-1 M(k)*a(n-k-1), where M(n) are the Motzkin numbers (A001006). A45994

a(n) = ∑_{k = 0..n} C(n,k)⁵. A5261