Properties of the Number -186961

One Hundred Eighty-Six Thousand Nine Hundred Sixty-One

Basics

Value: -186962 → -186961 → -186960

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 31 × 37 × 163

Divisors: 1, 31, 37, 163, 1147, 5053, 6031, 186961

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -101101101001010001

Octal: -555121

Duodecimal: -90241

Hexadecimal: -2da51

Square: 34954415521

Square Root: 432.38987037163577

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) = 2·a(n-1) + 9·a(n-2), with a(0)=a(1)=1. A2535

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

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

Lucas pseudoprimes whose reversal is prime. A164824

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

Expansion of e.g.f. sec(sin(arctan(x))) = 1/cos(x/sqrt(1+x²)) (even powers only). A12028