Properties of the Number 19191

Nineteen Thousand One Hundred Ninety-One

Basics

Value: 19190 → 19191 → 19192

Parity: odd

Prime: No

Previous Prime: 19183

Next Prime: 19207

Digit Sum: 21

Digital Root: 3

Palindrome: Yes

Factorization: 3 × 6397

Divisors: 1, 3, 6397, 19191

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100101011110111

Octal: 45367

Duodecimal: B133

Hexadecimal: 4af7

Square: 368294481

Square Root: 138.53158484620033

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 nXk 0..1 arrays with every element equal to 0, 1, 2 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302265

Numbers whose consecutive digits differ by 8. A48410

Integers of the form 8k + 7 that can be written as a sum of four distinct squares of the form m, m + 2, m + 3, m + 4, where m == 2 (mod 4). A243581

Numbers using only digits 1 and 9. A284294

Nested palindromes. A344550

Palindromes of form k² + k + 9. A27727

a(1) = 2; then smallest palindrome > 1 not occurring earlier such that every partial concatenation is a prime. A88086

Palindromes n such that 10n01 is a prime. A99744

Consider a decimal number of k>=2 digits x = d_k*10^k-1 + d_k-1*10^k-2 + … + d₂*10 + d₁ and the transform T(x)-> (d_k+d_k-1 mod 10)*10^k-1 + (d_k-1+d_k-2 mod 10)*10^k-2 + … + (d₂+d₁ mod 10)*10 + (d₁+d(k) mod 10). Sequence lists the numbers·such that T(x)=0. A243994

Largest palindromic substring in 6ⁿ. A46264