Properties of the Number -3161

One Hundred Sixty-One

Basics

Value: -3162 → -3161 → -3160

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 29 × 109

Divisors: 1, 29, 109, 3161

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -110001011001

Octal: -6131

Duodecimal: -19B5

Hexadecimal: -c59

Square: 9991921

Square Root: 56.22277118748239

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) = 7 + 12·n - 6·n². A157517

G.f. A(x) satisfies: A(x) = x + x² / exp(A(x) - A(x²)/2 + A(x³)/3 - A(x⁴)/4 + ...). A345233

a(n) = n·prime(n). A33286

a(n) = 2·n² - n + 1. A130883

Smallest palindrome greater than n in bases n and n+1. A48268

a(0) = 0, a(1) = 1; a(n) = max { 4·a(k) + a(n-k) | 1 <= k <= n/2 }, for n > 1. A116520

Compound filter: a(n) = P(A003557(n), A048250(n)), where P(n,k) is sequence A000027 used as a pairing function. A291750

a(n) = ∑_k=1..n k·d(k) where d(k) is the number of divisors of k. A143127

Numerator of the average height of a binary search tree on n elements. A195582

Number of odd-length integer partitions of n with integer alternating product. A347444