Properties of the Number -118441

One Hundred Eighteen Thousand Four Hundred Forty-One

Basics

Value: -118442 → -118441 → -118440

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 83 × 1427

Divisors: 1, 83, 1427, 118441

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -11100111010101001

Octal: -347251

Duodecimal: -58661

Hexadecimal: -1cea9

Square: 14028270481

Square Root: 344.1525824398242

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

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

Constant term in the expansion of (1 + x + y + z + 1/(x·y*z))ⁿ. A361637

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

Semiprimes k that divide Fibonacci(k-1). A177086

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