Properties of the Number -84000

Eighty-Four Thousand

Basics

Value: -84001 → -84000 → -83999

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 ⁵ × 3 × 5 ³ × 7

Divisors: 1, 2, 3, 4, 5, 6, 7, 8, 10, 12

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10100100000100000

Octal: -244040

Duodecimal: -40740

Hexadecimal: -14820

Square: 7056000000

Square Root: 289.8275349237888

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 read by rows: T(n,k) is the coefficient A_k in the transformation of 1 + x + x² + ... + xⁿ to the polynomial A_k*(x-(-1)^k)^k for 0 <= k <= n. A248976

Triangle read by rows: T(n,k)=(-1)^k*(2n/(2n-k))5^n-k*binomial(2n-k,k) (0<=k<=n, n>=1). A104064

Determinant of n-th continuous block of 4 consecutive squares of primes. A118873

Triangle read by rows: T(n,k) is the number of labeled 2-connected planar graphs with n nodes and k edges, n >= 3, n <= k <= 3(n-2). A100960

a(n) = 8·7*6·5*4·3*2·1 + 16·15·14·12·11·10·9 + ... + (up to the n-th term). A319872

a(n) = n*(n - 1)³/2. A19582

Number of 3-voter voting schemes with n linearly ranked choices. A7009

a(n) = (2n)!*∑_i=1..n 1/i. A46673

Triangular array T(n,k) giving number of 2-connected graphs with n labeled nodes and k edges (n >= 3, n <= k <= n(n-1)/2). A123534

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum plus the upper median minus the lower median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one. A237494