Properties of the Number 19515

Nineteen Thousand Five Hundred Fifteen

Basics

Value: 19514 → 19515 → 19516

Parity: odd

Prime: No

Previous Prime: 19507

Next Prime: 19531

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 1301

Divisors: 1, 3, 5, 15, 1301, 3903, 6505, 19515

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100110000111011

Octal: 46073

Duodecimal: B363

Hexadecimal: 4c3b

Square: 380835225

Square Root: 139.69609872863307

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

Number of equivalence classes of binary words of length n for the subword 10110. A317669

Irregular table: the n-th row polynomial is given by the formal power series expansion of ∑_{k >= 0} (1 + q)^{n·k + n²}*∏_{j = 1..k} (1 - (1 + q)^2·j-1), n >= 1. A340882

Consecutive states of the linear congruential pseudo-random number generator (31481·s+21139) mod 10⁵ when started at s=1. A384341

Sum of the squares of the first n squarefree numbers. A111715

Number of n X 5 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 1 0 vertically. A207302

Number of n X 5 0..1 arrays with every element equal to 0, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero. A298914

Number of nX3 0..1 arrays with every element equal to 0, 1 or 4 horizontally or vertically adjacent elements, with upper left element zero. A301657

a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0, |s(i) - s(i-1)| = 1 for i = 1,2,3; |s(i) - s(i-1)| <= 1 for i >= 4, s(n) = 1. Also a(n) = T(n,n-1), where T is the array defined in A026082. A26084

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 1 0 vertically. A207305

a(n) = 1 + 0!*1!*2!*...*n!. A19515