Properties of the Number -2042

Forty-Two

Basics

Value: -2043 → -2042 → -2041

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 2 × 1021

Divisors: 1, 2, 1021, 2042

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -11111111010

Octal: -3772

Duodecimal: -1222

Hexadecimal: -7fa

Square: 4169764

Square Root: 45.18849411078001

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

Imaginary Rabbits: imaginary part of a(0)=i; a(1)=-i; a(n) = a(n-1) + i·a(n-2), with i = sqrt(-1). A14291

Expansion of ∏_k>=1 (1 - x^k)^k+1. A299019

Array read by antidiagonals: T(m,n) = number of m-ary words of length n with cyclically adjacent elements differing by 2 or less. A285280

Goodstein sequence starting with 4: to calculate a(n+1), write a(n) in the hereditary representation in base n+2, then bump the base to n+3, then subtract 1. A56193

Number of integer partitions of n whose sequence of frequencies is strictly increasing. A100471

'Eban' numbers (the letter 'e' is banned!). A6933

Total number of even parts in all partitions of n. A66898

a(n) = n³ - 4·n² + 6·n - 2. A188377

a(1)=1, for n>1, a(n) is the least number > a(n-1) such that the Hamming distance D(a(n-1), a(n)) = 2. A206853

Number of integer partitions of n whose median appears more times than any other part, i.e., partitions containing a unique mode equal to the median. A363740