Properties of the Number -8090

Ninety

Basics

Value: -8091 → -8090 → -8089

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 5 × 809

Divisors: 1, 2, 5, 10, 809, 1618, 4045, 8090

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1111110011010

Octal: -17632

Duodecimal: -4822

Hexadecimal: -1f9a

Square: 65448100

Square Root: 89.94442728707543

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

The expansion of R(q)^-5 in powers of q where R() is the Rogers-Ramanujan continued fraction. A229793

Negative integers n such that in balanced ternary representation the number of occurrences of each trit doubles when n is squared. A257868

Perrin sequence (or Perrin numbers, or Ondrej Such sequence): a(n) = a(n-2) + a(n-3) with a(0) = 3, a(1) = 0, a(2) = 2. A1608

Numbers k such that p(k), p(k)+6, p(k)+12, p(k)+18 are consecutive primes, where p(k) denotes k-th prime. A90832

Number T(n,k) of permutations p of [n] such that the up-down signature of 0,p has nonnegative partial sums with a maximal value of k; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A258829

The q expansion of λ⁵, a Hauptmodul for Gamma₁(5). A78905

Partitioning integers to avoid arithmetic progressions of length 3. A6999

Numbers n such that if p=prime(n), then p, p+6, p+12, p+18 are consecutive primes with p=6·k+5 for some k, where prime(n) denotes n-th prime. A90835

T(n,k)=Number of nXk 0..2 arrays with values 0..2 introduced in row major order, the number of instances of each value within one of each other, and every element equal to one or two horizontal or vertical neighbors. A199041

T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 4 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A300769