Properties of the Number -16131

Sixteen Thousand One Hundred Thirty-One

Basics

Value: -16132 → -16131 → -16130

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 19 × 283

Divisors: 1, 3, 19, 57, 283, 849, 5377, 16131

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11111100000011

Octal: -37403

Duodecimal: -9403

Hexadecimal: -3f03

Square: 260209161

Square Root: 127.00787377166819

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) = n² - (n-1)² - (n-2)² - ... - 1². A179297

Number of ordered triples (i,j,k) with |i| + |j| + |k| <= n and gcd(i,j,k) <= 1. A100450

T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 nXk array. A219915

Array read by antidiagonals: T(m,n) = number of dominating sets in the lattice (rook) graph K_m X K_n. A287274

Numbers n such that 5·10ⁿ-1 is prime. A56712

p² + 2 where p is a prime. A61725

Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths starting at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 5, n >= 2. A214023

a(n) = floor(a(n-1)/2) + a(n-2) with a(0)=1, a(1)=2. A64650

a(n) = 4ⁿ - 2·2ⁿ + 3. A191341

Numbers k such that k⁶ - 2 and k⁶ + 2 are both primes. A154938