Properties of the Number -6042

Forty-Two

Basics

Value: -6043 → -6042 → -6041

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 19 × 53

Divisors: 1, 2, 3, 6, 19, 38, 53, 57, 106, 114

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1011110011010

Octal: -13632

Duodecimal: -35B6

Hexadecimal: -179a

Square: 36505764

Square Root: 77.7303029712351

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

Dispersion of A047215, (numbers >1 and congruent to 0 or 2 mod 5), by antidiagonals. A191723

Numbers k such that for any positive integers (a, b), if a·b = k then a + b is prime. A80715

a(n) = ∑_{k=0..floor(n/6)} binomial(n-3k,3k). A100134

Number of four-prime Carmichael numbers less than 10ⁿ. A174612

Lower level digraph derived from a voltage graph. A115055

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

Sum of all the parts in the partitions of n into 9 primes. A326540

Write n as a sum of distinct powers of 2, then take the primes of those powers of 2 and multiply them together. A325094

Number of partitions of 5n such that cn(0,5) = cn(1,5) = cn(4,5) <= cn(2,5) = cn(3,5). A36884

Expansion of ∏_k>=1 ((1+x^k)/(1-x^k))^2·k-1. A261452