Properties of the Number -18592

Eighteen Thousand Five Hundred Ninety-Two

Basics

Value: -18593 → -18592 → -18591

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ⁵ × 7 × 83

Divisors: 1, 2, 4, 7, 8, 14, 16, 28, 32, 56

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100100010100000

Octal: -44240

Duodecimal: -A914

Hexadecimal: -48a0

Square: 345662464

Square Root: 136.35248439247448

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) which contains 16·n!*2^floor((n+1)/2) times the coefficient [tⁿ x^k] exp(t·x)/(15 + exp(8·t)) in row n, column k. A171685

Numbers k such that k divides the (right) concatenation of all numbers <= k written in base 25 (most significant digit on right). A29518

Array read by descending antidiagonals: A(n,k) is the number of oriented colorings of the edges of a regular n-dimensional simplex using up to k colors. A327083

Number of oriented colorings of the edges (or triangular faces) of a regular 4-dimensional simplex with n available colors. A331350

Irregular triangle read by rows: row n consists of the coefficients of the expansion of the polynomial (2·x + 2)ⁿ + (x² - 1)*(x + 2)ⁿ. A300184

Array read by descending antidiagonals: T(n,k) is the number of oriented colorings of the triangular faces of a regular n-dimensional simplex using k or fewer colors. A337883

Expansion of g.f. A(x) satisfying 0 = ∑_n=-oo..+oo xⁿ * A(x)ⁿ * (2 - x^n-1)ⁿ⁺¹. A366732

Almost trivalent maps. A2009

a(n) = A347961(A276086(n)), where A347961 is Dirichlet convolution of A342001 with itself. A347962

a(n) is the number of ways to select three distinct points of an n X n grid forming a triangle whose sides do not pass through a grid point. A372218