Properties of the Number -8188

One Hundred Eighty-Eight

Basics

Value: -8189 → -8188 → -8187

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 23 × 89

Divisors: 1, 2, 4, 23, 46, 89, 92, 178, 356, 2047

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1111111111100

Octal: -17774

Duodecimal: -48A4

Hexadecimal: -1ffc

Square: 67043344

Square Root: 90.48756820690895

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(n) = a(n-2) - (a(n-1) - a(n-2)) if (n mod 2) = 0, otherwise a(n) = a(n-1) - (a(n-3) - a(n-4)), with a(0) = 0, a(1) = 1, a(2) = -1, a(3) = 2. A135690

Triangle T(n, k) = A169643(n, k) - A169653(n, 1) + 1, read by rows. A169654

a(n) = 2ⁿ - 4. A28399

a(n) is the number of times that only 2 pegs have disks on them during the optimal solution to a Towers of Hanoi problem with n disks. A347789

Second diagonal under the main diagonal in A172119 written in a square (see comment). A173033

Triangle read by rows: T(n,k) = number of edges in a "frame" of size n X k (see Comments in A331457 for definition). A332600

a(n) = n*(31·n-1)/2. A22288

Sum of divisors computed for conjugated prime factorization: a(n) = A000203(A122111(n)). A323173

Sequence is defined by the condition that ∑_d∣n a(d)^n/d = 1 if n=1, = 0 if n>1. A260685

Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 619", based on the 5-celled von Neumann neighborhood. A283353