Properties of the Number -6142

One Hundred Forty-Two

Basics

Value: -6143 → -6142 → -6141

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 × 37 × 83

Divisors: 1, 2, 37, 74, 83, 166, 3071, 6142

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1011111111110

Octal: -13776

Duodecimal: -367A

Hexadecimal: -17fe

Square: 37724164

Square Root: 78.37091297158659

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 parts of the recursive sequence a(n+2) = ∑_k=0..n binomial(n,k)*a(k)*a(n+1-k), with a(0)=1, a(1)=2i. A289087

Expansion of 1/(1+x²-2·x³). A77912

Number of partitions of n into an odd number of parts. A27193

a(2·n) = 3·2ⁿ - 2; a(2·n+1) = 2ⁿ⁺² - 2. A27383

a(n) = 3·2ⁿ - 2. A33484

Number of parts in all partitions of n into distinct parts. A15723

One half of number of non-self-conjugate partitions; also half of number of asymmetric Ferrers graphs with n nodes. A701

Number of partitions of 2n of type EO (see Comments). A236559

Preperiod (or threshold) of orbit of Post's {00, 1101} tag system applied to the word (100)ⁿ, or -1 if this word has an unbounded trajectory. A284119

Number of integer partitions of n > 0 where the maximum part equals the length minus the number of distinct parts. A324518