Properties of the Number -161027

One Hundred Sixty-One Thousand Twenty-Seven

Basics

Value: -161028 → -161027 → -161026

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 283 × 569

Divisors: 1, 283, 569, 161027

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -100111010100000011

Octal: -472403

Duodecimal: -7922B

Hexadecimal: -27503

Square: 25929694729

Square Root: 401.28169656738646

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

Bruckman-Lucas pseudoprimes: k | (L_k - 1), where k is composite and L_k = Lucas numbers A000032. A5845

Odd composite n such that n divides Fibonacci(n) + 1. A94395

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

Composite n such that Fibonacci(n) == Legendre(n,5) == -1 (mod n). A94063

Composite numbers k that divide both Fibonacci(k+1) and Fibonacci(k) + 1. A94411

Strong Lucas pseudoprimes. A217255

Extra strong Lucas pseudoprimes. A217719

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

Frobenius pseudoprimes == 2,3 (mod 5) with respect to Fibonacci polynomial x² - x - 1. A212423

Composite terms in A128288(n) = A023163(n)/3 for n>1. A128289