Properties of the Number -8492

Four Hundred Ninety-Two

Basics

Value: -8493 → -8492 → -8491

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 11 × 193

Divisors: 1, 2, 4, 11, 22, 44, 193, 386, 772, 2123

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10000100101100

Octal: -20454

Duodecimal: -4AB8

Hexadecimal: -212c

Square: 72114064

Square Root: 92.15204826806618

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

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) = ∑_j=0..n (-k)^j * binomial(n,j)³. A336179

a(n) = ∑_k=0..n (-3)^k * binomial(n,k)³. A336182

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) = ∑_j=0..n (-k)^j * binomial(n,j)^k. A336201

a(n) = n·prime(n). A33286

Numbers k such that 2^k - 5 is prime. A59608

Sum of next n squares. A72474

Number of ways to place 5 nonattacking queens on a 5 X n board. A61991

Number of ways to place m nonattacking queens on an m X n board, 1 <= m <= n (triangular array). A269133

a(n) = ∑_k=0..7 (n + k)². A276026

The profiles of the backtrack tree for the n queens problem, triangle read by rows. A319284