Properties of the Number -33040

Thirty-Three Thousand Forty

Basics

Value: -33041 → -33040 → -33039

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 ⁴ × 5 × 7 × 59

Divisors: 1, 2, 4, 5, 7, 8, 10, 14, 16, 20

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1000000100010000

Octal: -100420

Duodecimal: -17154

Hexadecimal: -8110

Square: 1091641600

Square Root: 181.7690842800282

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

Normalized sequence of cumulants formed from moments in a quantum many-body problem at its critical point. A11859

A binomial coefficient sum. A3161

Number of ways to place 2 nonattacking amazons (superqueens) on an n X n board. A172200

Total number A(n,k) of k-tuples of semi-Dyck paths from (0,0) to (n,n-2·j) for j=0..floor(n/2); square array A(n,k), n>=0, k>=0, read by antidiagonals. A357824

Triangle T(n,k), n >= 0, 0 <= k <= n, read by rows: T(n,k) is the number of forests of trees on n or fewer nodes using a subset of labels 1..n and k edges. A144258

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with the (lower) median of each row and column nondecreasing. A237625

Number of (n+2)X(1+2) 0..3 arrays with the (lower) median of each row and column nondecreasing. A237624

The binary expansion of a(n) is an initial 1 bit then tracks where the swaps occur in the exchange sort algorithm sorting the binary expansion of n into decreasing order. A380145

a(n) = ∑_k=0..n A039599(n,k)³. A382403