Properties of the Number 19123

Nineteen Thousand One Hundred Twenty-Three

Basics

Value: 19122 → 19123 → 19124

Parity: odd

Prime: No

Previous Prime: 19121

Next Prime: 19139

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 13 × 1471

Divisors: 1, 13, 1471, 19123

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100101010110011

Octal: 45263

Duodecimal: B097

Hexadecimal: 4ab3

Square: 365689129

Square Root: 138.28593565507666

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

Triangle T(n,k) giving the number of terms of A219666 which have n digits (A084558) in their factorial base expansion and whose most significant digit (A099563) in that base is k. A230420

Least number having exactly two odd prime factors that differ by 2·n². A190052

Triangle A230420 transposed. A230421

Positions of new record minima A372935 in A071961. A372936

a(n) = (2·n³ + 5·n² - 11·n)/2. A162257

G.f. 1/sum(k>=0, (-1)^k * x^k*(k+1/2)). A208061

G.f. A(x) satisfies A(x/(1-x))=x*(1+A(x))/(1-A(x)-A(x)²). A201779

a(n) is the largest k such that the sum of k consecutive reciprocals 1/p_n + ... + 1/p_n+k-1 does not exceed 1 (where p_n = n-th prime). A327600

Number of (n+2)X(4+2) 0..1 arrays with no 3x3 subblock diagonal sum less than the antidiagonal sum or central row sum equal to the central column sum. A258541

Number of (n+2)X(6+2) 0..1 arrays with no 3x3 subblock diagonal sum less than the antidiagonal sum or central row sum equal to the central column sum. A258543