Properties of the Number -18877

Eighteen Thousand Eight Hundred Seventy-Seven

Basics

Value: -18878 → -18877 → -18876

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 43 × 439

Divisors: 1, 43, 439, 18877

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -100100110111101

Octal: -44675

Duodecimal: -AB11

Hexadecimal: -49bd

Square: 356341129

Square Root: 137.3935951927891

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

MM-numbers of crossing set partitions. A324324

Number of ON states after n generations of cellular automaton based on f.c.c. lattice with each cell adjacent to its twelve neighbors. A151776

Numbers which can written in exactly four ways as a sum of two distinct nonzero pentagonal numbers. A333014

Andrews's shadow difference function D₃(q). A275633

Expansion of x*(1 + x² - x³) / ( (1-x)*(1-x-x⁴) ). A168639

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 107", based on the 5-celled von Neumann neighborhood. A270166

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 299", based on the 5-celled von Neumann neighborhood. A271154

Number of minimal total dominating sets in the n-dipyramidal graph. A298823

Let a₀ = 1 and for n > 0, let a_n be the smallest positive integer not already in the sequence such that (a₀ + a₁ x + a-2x² + ....)^1/3 has integer coefficients. (Hanna's A083349). Let f(n) = n th term in the present sequence. Then a₀ + a₁ x + a₂ x² + ... = (1-x)^f(1) (1-x²)^f(2) (1-x³)^f(3) .... A110879

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, -1, 1), (0, 1, -1), (1, 0, -1), (1, 1, 1)}. A149666