Properties of the Number 19261

Nineteen Thousand Two Hundred Sixty-One

Basics

Value: 19260 → 19261 → 19262

Parity: odd

Prime: No

Previous Prime: 19259

Next Prime: 19267

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 11 × 17 × 103

Divisors: 1, 11, 17, 103, 187, 1133, 1751, 19261

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100101100111101

Octal: 45475

Duodecimal: B191

Hexadecimal: 4b3d

Square: 370986121

Square Root: 138.78400484205665

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

Consecutive states of the linear congruential pseudo-random number generator for 16-bit WATFOR/WATFIV when started at 1. A384158

Expansion of ∏_k>=1 1/(1 - x^2·k+3)^k. A263352

Table read by rows. Number of set partitions of [n] with respect to genus g. A370235

Number of partitions p of n such that min(p) + (number of parts of p) is not a part of p. A238495

n times π(n) is a palindrome, where π(n) = PrimePi(n) = A000720(n). A116054

Coefficient array of the second column of the inverse of the Riordan array ((1+(r+1)x)/(1+(r+2)x+rx²), x/(1+(r+2)x+rx²)). A188463

Number of length 3+2 0..n arrays with the sum of medians of adjacent triples multiplied by some arrangement of +-1 equal to zero. A253131

G.f. A(x) satisfies: ∑_n>=0 A(x)⁽ⁿ⁺¹²) * xⁿ = ∑_n>=0 (1 + A(x)ⁿ⁺¹)ⁿ * xⁿ. A326275

Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite VSV = VPI-7 Na26H6[Zn16Si56O144].44H2O starting from a T3 atom. A19261

Numbers m such that there exist positive integers i <= m and j >= m such that m = ∑_k=i..j A001065(k), where A001065(k) = sum of the proper divisors of k, and i and j do not both equal m. A346140