Properties of the Number -8822

Eight Hundred Twenty-Two

Basics

Value: -8823 → -8822 → -8821

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 11 × 401

Divisors: 1, 2, 11, 22, 401, 802, 4411, 8822

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10001001110110

Octal: -21166

Duodecimal: -5132

Hexadecimal: -2276

Square: 77827684

Square Root: 93.92550239418472

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

A McMullen transform involving x->x+1/x of Lehmer's polynomial gives the polynomial used to get this expansion sequence: p(x)=1 + x + 10 x² + 8 x³ + 44 x⁴ + 28 x⁵ + 113 x⁶ + 57 x⁷ + 191 x⁸ + 79 x⁹ + 227 x¹⁰ + 79 x¹¹ + 191 x¹² + 57 x¹³ + 113 x¹⁴ + 28 x¹⁵ + 44 x¹⁶ + 8 x¹⁷ + 10 x¹⁸ + x¹⁹ + x²⁰. A143465

a(0) = 1, a(n) = 5·n² + 2 for n>0. A10001

Irregular triangle read by rows: T(n,k) is the number of polyhedra with n faces and k vertices (n >= 4, k=4..2n-4). A212438

T(n,k)=Number of nXk 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of the elements above it or two plus the sum of the elements diagonally to its northwest, modulo 4. A240364

Numbers n such that the decimal expansions of both n and n² have 2 as smallest digit and 8 as largest digit. A257368

Expansion of series related to Liouville's Last Theorem: g.f. ∑_t>0 (-1)^t+1 *x^t*(t+1/2) / ( (1-x^t)³ *∏_i=1..t (1-xⁱ) ). A59820

Write 0, 1, 2, 3, 4, ... in a triangular spiral, then a(n) is the sequence found by reading the terms along the line from 0 in the direction 0, 7, ... A62725

Triangle T(n,k) = number of polyhedra (triconnected planar graphs) with n faces and k vertices, where (n/2+2) <= k <= (2n+8). A58787

Numbers n that have an equal number of even and odd values of A001221(k) for 1 <= k <= n. A275547

Triangle T(n,k) = number of polyhedra (triconnected planar graphs) with n edges and k vertices (or k faces), where (n/3+2) <= k <= (2n/3). Note that there is no such k when n=7. A58788