Properties of the Number -3162

One Hundred Sixty-Two

Basics

Value: -3163 → -3162 → -3161

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 17 × 31

Divisors: 1, 2, 3, 6, 17, 31, 34, 51, 62, 93

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -110001011010

Octal: -6132

Duodecimal: -19B6

Hexadecimal: -c5a

Square: 9998244

Square Root: 56.231663678038196

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

a(n) = ∑_k=0..n k^p*q^k, where p=3, q=-2. A232602

Expansion of 1/((1+x+x²)*(1+5·x+x²)). A110311

Expansion of g.f. ∏_{k >= 1} (1 - x^k)^-k*(k+1/2). A294

Denominators of the fraction ∑_n>=0 {a(n)/a(n+1)} = a(0)/a(1) + a(1)/a(2) + a(2)/a(3) + ... such that the sum has the concatenation of these denominators as decimal part. Case a(0) = 1 and a(1) = 10. A305666

a(n) = 2·n² + 3·n + 3. A33816

Expansion of ∑_k>=0 x^k²+k/((1-x)(1-x²)...(1-x^2k)). A122134

Largest number whose 4th power has n digits. A114322

Number of partitions of n such that smaller parts do not occur more frequently than greater parts. A171979

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 3 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 3 4 6 or 7. A252640

Values of the difference d for 5 primes in arithmetic progression with the minimal start sequence {5 + j·d}, j = 0 to 4. A206039