Properties of the Number -42031

Forty-Two Thousand Thirty-One

Basics

Value: -42032 → -42031 → -42030

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 11 × 3821

Divisors: 1, 11, 3821, 42031

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1010010000101111

Octal: -122057

Duodecimal: -203A7

Hexadecimal: -a42f

Square: 1766604961

Square Root: 205.01463362404158

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 defined in A064641 read by rows. A64642

a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2^p+1 + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = a(2) = a(3) = 1. A49885

a(n) = least composite number such that σ(a(n)+n!) = σ(a(n))+n! where σ() = A000203. A54982

a(n) = [ (3rd elementary symmetric function of P(n))/(first elementary symmetric function of P(n)) ], where P(n) = {first n+2 primes}. A24453

a(n)= least number k > a(n-1) such that k*(2^p-1)*(k*(2^p-1)+1)-1 is prime, where p = A000043(n) = Mersenne exponents. A200655

a(n) is the number of partitions p = p(1) >= p(2) >= ... >= p(k) of n whose alternating sum is a part of p. A308410