Properties of the Number -33042

Thirty-Three Thousand Forty-Two

Basics

Value: -33043 → -33042 → -33041

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 5507

Divisors: 1, 2, 3, 6, 5507, 11014, 16521, 33042

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1000000100010010

Octal: -100422

Duodecimal: -17156

Hexadecimal: -8112

Square: 1091773764

Square Root: 181.7745856823775

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

T(n,k)=Number of length n+k 0..3 arrays with at most two downsteps in every k consecutive neighbor pairs. A255660

a(1) = 1; a(n) = 2 + n * ∑_k=1..n-1 a(k). A383436

a(n) = ∑_d∣n d^τ(n/d). A345270

G.f.: (x+4·x³+x⁵)/((1-x)²*(1-x²)²*(1-x³)). A83707

Centered 47-gonal numbers. A129428

Number of length n+6 0..3 arrays with at most two downsteps in every 6 consecutive neighbor pairs. A255658

Number of length n+2 0..3 arrays with at most two downsteps in every n consecutive neighbor pairs. A255662

Number of 3Xn integer arrays with each element equal to the number of horizontal and antidiagonal neighbors equal to itself. A266013

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