Properties of the Number -11690

Eleven Thousand Six Hundred Ninety

Basics

Value: -11691 → -11690 → -11689

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 5 × 7 × 167

Divisors: 1, 2, 5, 7, 10, 14, 35, 70, 167, 334

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10110110101010

Octal: -26652

Duodecimal: -6922

Hexadecimal: -2daa

Square: 136656100

Square Root: 108.12030336620407

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

Weird numbers: abundant (A005101) but not pseudoperfect (A005835). A6037

Unitary weird numbers: unitary abundant (A034683) but not unitary pseudoperfect (A293188). A64114

Number of heptagons that can be formed with perimeter n. A288253

Bi-unitary weird numbers: bi-unitary abundant numbers (A292982) that are not bi-unitary pseudoperfect (A292985). A292986

Infinitary weird numbers: infinitary abundant numbers (A129656) that are not infinitary pseudoperfect numbers (A306983). A306984

Zero, together with positive numbers k such that prime(k) + k is a square. A64371

Consider the 2ⁿ values of A139250(i)/i² for 2ⁿ <= i < 2ⁿ⁺¹; a(n) = value of i where this quantity is minimized. A170927

a(n) = ((n + 1) - 9*(n + 1)² + 8*(n + 1)³)/6. A331987

a(n) = ∑_{k=1..floor(n/2)} T(n, 2k), array T as in A049777. A49779

Number of primitive (period n) n-bead necklace structures using an infinite alphabet. A276547