Properties of the Number -163081

One Hundred Sixty-Three Thousand Eighty-One

Basics

Value: -163082 → -163081 → -163080

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 17 × 53 × 181

Divisors: 1, 17, 53, 181, 901, 3077, 9593, 163081

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -100111110100001001

Octal: -476411

Duodecimal: -7A461

Hexadecimal: -27d09

Square: 26595412561

Square Root: 403.832886228945

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

Composite numbers k such that k divides F(k-1) where F(j) are the Fibonacci numbers. A69106

Frobenius pseudoprimes with respect to Fibonacci polynomial x² - x - 1. A212424

Composite n such that n divides both Fibonacci(n-1) and Fibonacci(n) - 1. A94401

Composite k such that Fibonacci(k) == Legendre(k,5) == 1 (mod k). A93372

Odd composite integers m such that F(m)² == 1 (mod m) and L(m) == 1 (mod m), where F(m) and L(m) are the m-th Fibonacci and Lucas numbers, respectively. A337625

Triangle read by rows: T(n,k) = A022168(n,k)*n!/binomial(n,k) + 1 - n!. A176419

Nonprimes n such that Mod(n,4) == 1 and denominator(Fibonacci((n-1)/4)/n) = 1. A91982

Strong pseudoprimes to base 30. A20256

Lucas pseudoprimes whose reversal is prime. A164824

Frobenius pseudoprimes == 1,4 (mod 5) with respect to Fibonacci polynomial x² - x - 1. A319168