Properties of the Number -8161

One Hundred Sixty-One

Basics

Value: -8162 → -8161 → -8160

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 8161

Divisors: 1, 8161

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1111111100001

Octal: -17741

Duodecimal: -4881

Hexadecimal: -1fe1

Square: 66601921

Square Root: 90.33825324855468

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 triangular sequence of coefficients of polynomials: p(x,n)=(-(x - 1)ⁿ*Sum[(((-1)ⁿ*(2·k + 1)^{n - 1}))*x^k, {k,0, Infinity}]+2*(x - 1)^{n + 1}*Sum[((-1)^{n + 1}*kⁿ)*x^k, {k, 0, Infinity}]/x). A154338

a(n) = prime(2ⁿ). A33844

Least k such that there are exactly n ways to choose a sequence of divisors, one of each element of the multiset of prime indices of k (with multiplicity). A355732

a(n) = prime(n²). A11757

D-toothpick sequence of the third kind starting with a single toothpick. A220500

Primes with first digit 8. A45714

Primes congruent to 2 mod 41. A142199

Primes of form n² + 6561. A256837

Primes p for which the period of reciprocal = (p-1)/8. A56213

Replace prime(k) with prime(2^k) in the prime factorization of n. A353397