Properties of the Number -7936

Nine Hundred Thirty-Six

Basics

Value: -7937 → -7936 → -7935

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ⁸ × 31

Divisors: 1, 2, 4, 8, 16, 31, 32, 62, 64, 124

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1111100000000

Octal: -17400

Duodecimal: -4714

Hexadecimal: -1f00

Square: 62980096

Square Root: 89.08422980528034

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

Triangle of coefficients of Euler polynomials 2ⁿ*E_n(x) (exponents in increasing order). A4174

Expansion of e.g.f. 2·exp(x)*(1-exp(x))/(1+exp(2·x)). A163747

Dirichlet inverse of A011782, 2^n-1. A349452

Real part of the coefficient [xⁿ] of the expansion of (1+i)/(1-i·exp(x)) - 1 multiplied by 2·n!, where i is the imaginary unit. A163982

T(n, k) = n! * [x^k] [yⁿ] sec(z)(x + z·sin(z)/y) where z = y·sqrt(x² - 1) for 0 <= k <= n+1 and T(-1, 0) = 1, triangle read by rows. A326722

Triangle read by rows, T(n,k) = 2^n-k*[x^k] Euler_polynomial(n, x), for n >= 0, k >= 0. A81733

T(n,k) = binomial(n,k)*A000111(n-k)*(-1)^n-k, 0 <= k <= n. A247453

T(n, k) = 2ⁿ * n! * [x^k] [zⁿ] (4·exp(x·z))/(exp(z) + 1)², triangle read by rows, for 0 <= k <= n. Coefficients of Euler polynomials of order 2. A326480

∏_n>=1 (1 + xⁿ)^a(n/n!) = 1 + tanh(x). A354176

a(n) = E2_n(0) with E2_n the polynomials defined in A326480. A326481