Properties of the Number 19450

Nineteen Thousand Four Hundred Fifty

Basics

Value: 19449 → 19450 → 19451

Parity: even

Prime: No

Previous Prime: 19447

Next Prime: 19457

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 5 ² × 389

Divisors: 1, 2, 5, 10, 25, 50, 389, 778, 1945, 3890

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100101111111010

Octal: 45772

Duodecimal: B30A

Hexadecimal: 4bfa

Square: 378302500

Square Root: 139.46325680981354

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+1)X(k+1) binary arrays with no 2X2 subblock determinant equal to any horizontal or vertical neighbor 2X2 subblock determinant. A185467

E.g.f. B = B(x,y) satisfies: A² + B² + C² = 1 + y² and A³ + B³ + C³ = 1 + y³, where functions A = A(x,y) and C = C(x,y) are described by A278885 and A278887, respectively. A278886

E.g.f. C = C(x,y) satisfies: A² + B² + C² = 1 + y² and A³ + B³ + C³ = 1 + y³, where functions A = A(x,y) and B = B(x,y) are described by A278885 and A278886, respectively. A278887

Triangle, read by rows, such that row n equals the coefficients of x^n²+n-1+k in F(x,n) for k = 1..n, where F(x,n) = (1 + x·F(x,n))*(1 + xⁿ/F(x,n)), for n>=1. A200171

Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 246", based on the 5-celled von Neumann neighborhood. A280331

Numbers k such that the continued fraction for sqrt(k) has period 47. A20386

Number of (1,1) steps starting at level zero in all peakless Motzkin paths of length n+3. A89737

Number of compositions (ordered partitions) of n with designated summands. A91601

Triangle read by rows: T(n,k) (0 <= k <= ceiling(n/2)-2) is the number of (1,1) steps starting at level k in all peakless Motzkin paths of length n (can be easily translated into RNA secondary structure terminology). A110238

Numbers n such that 6·p(n)-1 and 6·p(n)+1 are twin primes and 6·p(n+1)-1 and 6·p(n+1)+1 are also twin primes with p(n) = n-th prime. A126655