Properties of the Number 19311

Nineteen Thousand Three Hundred Eleven

Basics

Value: 19310 → 19311 → 19312

Parity: odd

Prime: No

Previous Prime: 19309

Next Prime: 19319

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 41 × 157

Divisors: 1, 3, 41, 123, 157, 471, 6437, 19311

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100101101101111

Octal: 45557

Duodecimal: B213

Hexadecimal: 4b6f

Square: 372914721

Square Root: 138.96402412135308

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

1 + ∑_k=2..n 2^(prime(k-1)/2). A80567

Matrix cube of triangle A121412. A121420

Column 1 of triangle A121420. A121422

a(1) = 1; thereafter a(n) is always the smallest integer > a(n-1) not leading to a contradiction, such that the concatenation of any four consecutive digits in the sequence is a prime. A152609

Square array, read by antidiagonals, where T(n,k) = T(n,k-1) + T(n-1,k+n+1) for n>0, k>0, such that T(n,0) = T(n-1,n+1) for n>0 with T(0,k)=1 for k>=0. A136737

Rectangular table, read by antidiagonals, where row n is equal to column 1 of matrix power A121412ⁿ⁺¹ for n>=0. A121426

Number of subpartitions of partition P=[0,0,1,1,1,2,2,2,2,3,3,3,3,3,4,...] (A052146). A121431

Number of distinct Tsuro tiles which are n-gonal in shape and have 2 points per side. A132102

The number of five-term Egyptian fractions of rational numbers, x/y, 0 < x/y < 1, ordered as below. The sequence is the number of (p,q,r,s,t) such that x/y = 1/p + 1/q + 1/r + 1/s + 1/t where p, q, r, s, and t are integers with p < q < r < s < t. A349085

Triangle read by rows: T(n,k) is the number of nondecreasing Dyck paths of semilength n and having k double rises at an even level (n >= 1, k >= 0). A nondecreasing Dyck path is a Dyck path for which the sequence of the altitudes of the valleys is nondecreasing. A121531