Properties of the Number -8163

One Hundred Sixty-Three

Basics

Value: -8164 → -8163 → -8162

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 907

Divisors: 1, 3, 9, 907, 2721, 8163

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1111111100011

Octal: -17743

Duodecimal: -4883

Hexadecimal: -1fe3

Square: 66634569

Square Root: 90.34932207825358

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

Expansion of (1-x-x^N)/((1-x)(1-x²)(1-x³)...(1-x^N)) for N = 7. A60026

a(1) = 9; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime. A46259

Numbers that are the sum of five third powers in nine or more ways. A345185

"Sloping binary representation" of powers of 3 (A000244), slope = -1. A37095

Numbers that are the sum of five third powers in exactly nine ways. A345186

π(n) is a power of 2, where π(n) = A000720(n) is the number of primes <= n. A73798

Number of inequivalent (mod D₄) ways to place 2 nonattacking knights on an n X n board. A243717

Triangle T(n,k) of numbers of minimal 4-covers of an unlabeled n+4-set that cover k points of that set uniquely (k=4,..,n+4). A57967

The cost of all leaves in the Fibonacci tree of order n. A178521

Number of partitions p of n such that m(p) < m(c(p)), where m = maximal multiplicity of parts, and c = conjugate. A240726