Properties of the Number -20090

Twenty Thousand Ninety

Basics

Value: -20091 → -20090 → -20089

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 × 7 ² × 41

Divisors: 1, 2, 5, 7, 10, 14, 35, 41, 49, 70

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100111001111010

Octal: -47172

Duodecimal: -B762

Hexadecimal: -4e7a

Square: 403608100

Square Root: 141.7391971192161

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) is n-th term of the Euler transform of -n,1,1,1,... . A292541

Expansion of (1-q)^k/∏_j=1..k (1-q^j) for k=16. A275644

Numbers k such that numerator(Bernoulli(2·k)/(2·k)) is different from numerator(Bernoulli(2·k)/(2·k*(2·k-1))). A90495

a(n) = 7·binomial(9·n+7,n)/(9·n+7). A234510

Number of compositions of n whose run-lengths are either strictly increasing or strictly decreasing. A333191

Expansion of exp( ∑_n>=1 -σ(8·n)*xⁿ/n ) in powers of x. A283168

a(n) = (k+1)*n + k*(k+1)/2, where k = A332542(n). A332544

Multiplicative orders of 2+-i modulo p == 3 (mod 4) that are congruent to 2 modulo 4. A385218

a(n) = 7·A000330(n). A169607

a(n) = 2·n*(6·n-1). A126964