Properties of the Number -3087

Eighty-Seven

Basics

Value: -3088 → -3087 → -3086

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 7 ³

Divisors: 1, 3, 7, 9, 21, 49, 63, 147, 343, 441

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -110000001111

Octal: -6017

Duodecimal: -1953

Hexadecimal: -c0f

Square: 9529569

Square Root: 55.560777532356404

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

E.g.f. exp( sinh(x) / exp(x) ) = exp( (1-exp(-2·x))/2 ). A9235

Expansion of ∏_k>=1 (1 - q^k)⁸/(1 - q^7·k) in powers of q. A282942

Square array A(n,k), n>=0, k>=0, read by antidiagonals, where A(n,k) = ∑_j=0..n (-k)^n-j*Stirling2(n,j). A309386

Triangle read by rows. T(n, k) = kⁿ * BellPolynomial(n, -1/k) for k > 0, if k = 0 then T(n, k) = kⁿ. A350261

Triangle read by rows. T(n, k) = B(n, n - k + 1) where B(n, k) = kⁿ * BellPolynomial(n, -1/k) for k > 0, if k = 0 then B(n, k) = kⁿ. A350262

Sum of the first n primes. A7504

Achilles numbers - powerful but imperfect: if n = Product(p_i^e_i) then all e_i > 1 (i.e., powerful), but the highest common factor of the e_i is 1, i.e., not a perfect power. A52486

Spt function: total number of smallest parts (counted with multiplicity) in all partitions of n. A92269

Double-bitters: only even length runs in binary expansion. A1196

Numbers that are the sum of 12 positive 7th powers. A3379