Properties of the Number 19168

Nineteen Thousand One Hundred Sixty-Eight

Basics

Value: 19167 → 19168 → 19169

Parity: even

Prime: No

Previous Prime: 19163

Next Prime: 19181

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ⁵ × 599

Divisors: 1, 2, 4, 8, 16, 32, 599, 1198, 2396, 4792

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 100101011100000

Octal: 45340

Duodecimal: B114

Hexadecimal: 4ae0

Square: 367412224

Square Root: 138.44854639901425

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..2 arrays with no element equal to more than one of its horizontal, diagonal or antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards. A281693

Total sum of repeated parts in all partitions of n. A194544

G.f.: ∑_n>=0 xⁿ * ∑_k=0..n binomial(n,k)² * x^k/(1-x)^k. A217661

Number of points on surface of truncated tetrahedron: a(n) = 14·n² + 2 for n > 0, a(0)=1. A5905

Expansion of (theta₃(z)*theta₃(11z) + theta₂(z)*theta₂(11z))⁴. A28612

a(n) = Glaisher's function β(2n+1). A322032

Irregular triangular array read by rows. Let S_n be the set of labeled graphs G on [n] with 2-colored nodes where black nodes are only connected to white nodes and vice versa. Orient the edges in each such graph G from black to white. T(n,k) is the number of graphs in S_n containing exactly k descents, n>=0, 0<=k<=A002620(n). A381058

Numbers whose trajectory under the Esucarys map ends at the fixed point 247. A129133

Number of 2Xn 0..2 arrays with no element equal to more than one of its horizontal, diagonal or antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards. A281694

a(n) is the sum of mutual Manhattan distances of the A000328(n) distinct grid points (x_i,y_i) in a square lattice such that x_i² + y_i² <= n². A393009