Properties of the Number -8187

One Hundred Eighty-Seven

Basics

Value: -8188 → -8187 → -8186

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 2729

Divisors: 1, 3, 2729, 8187

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1111111111011

Octal: -17773

Duodecimal: -48A3

Hexadecimal: -1ffb

Square: 67026969

Square Root: 90.48204241726643

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+3) = 2a(n+2) - 3a(n+1) + 2a(n); a(0) = 1, a(1) = 3, a(2) = 4. A105579

Sequence defined by the recurrence formula a(n+1)=sum(a(p)*a(n-p)+k,p=0..n)+l for n>=1, with here a(0)=1, a(1)=0, k=-1 and l=-1. A176952

Smallest positive number that can be written as sum of distinct Fibonacci numbers in n ways. A13583

a(n) = 2ⁿ - 5. A168616

Greatest number (in decimal representation) with n nonprime substrings in binary representation (substrings with leading zeros are considered to be nonprime). A217112

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

Number of maximal sum-free and product-free subsets of {1..n}. A326497

Lexicographically earliest sequence of distinct positive integers with no finite subset summing to a power of 2. A353889

Number of partitions p of n such that floor(mean(p)) is a part and ceiling(mean(p)) is not. A241342

Sums of 12 distinct powers of 2. A38463