Properties of the Number -88384

Eighty-Eight Thousand Three Hundred Eighty-Four

Basics

Value: -88385 → -88384 → -88383

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 2 ⁶ × 1381

Divisors: 1, 2, 4, 8, 16, 32, 64, 1381, 2762, 5524

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10101100101000000

Octal: -254500

Duodecimal: -43194

Hexadecimal: -15940

Square: 7811731456

Square Root: 297.2944668169927

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) = ∑_{k=0..floor(n/3)} C(n-k,2·k) * 2^k * (-2)^n-3·k. A99784

Expansion of e.g.f. csc(x)*(1 - sqrt(1 - 4·sin(x)))/2. A295237

G.f. satisfies: A(x) = ∑_n>=0 xⁿ*[∑_k=0..n C(n,k)² *x^k* A(x)^2k]. A183876

Row 4 of array in A265080. A265081

a(n) is the number of ways to evaluate a bivariate polynomial of the form p(T,X) = p00 + T·q(X) where q(X) is an univariate polynomial of degree n. Each addition or multiplication takes exactly two arguments, and two parenthesizations which are equal modulo commutativity are considered as a unique way to evaluate p(T,X). A173157