Properties of the Number -10088

Ten Thousand Eighty-Eight

Basics

Value: -10089 → -10088 → -10087

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ³ × 13 × 97

Divisors: 1, 2, 4, 8, 13, 26, 52, 97, 104, 194

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10011101101000

Octal: -23550

Duodecimal: -5A08

Hexadecimal: -2768

Square: 101767744

Square Root: 100.43903623591775

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

Expansion of e.g.f. exp( x·exp(-x) ). A3725

Square array A(n,k), n>=0, k>=0, read by antidiagonals, where A(0,k) = 1 and A(n,k) = (-1)^k+1 * ∑_i=0..n-1 (-1)ⁱ * binomial(n-1,i) * binomial(i+1,k) * A(n-1-i,k) for n > 0. A292948

Square array T(n,k), n>=0, k>=0, read by antidiagonals, where T(0,k) = 1 and T(n,k) = (-1)^k+1 * k! * ∑_i=0..n-1 (-1)ⁱ * binomial(n-1,i) * binomial(i+1,k) * T(n-1-i,k) for n > 0. A292973

Exponential Riordan array [exp(x·exp(-x)),x]. A215652

a(n) = ∑_m=0..n (-1)^m * binomial(n,m)*(1·3*5*...*(4m-1)). A102188

a(n) = 6·n² + 2 for n > 0, a(0)=1. A5897

T(n,k) = Number of n X k 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 0 1 vertically. A207453

T(n,k) is the number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5 (constant-stress 1 X 1 tilings). A235280

Numbers k such that (2^k + 1)² - 2 = 4^k + 2^k+1 - 1 is prime. A91513

Coefficients in asymptotic expansion of sequence A052129. A116603