Properties of the Number -20192

Twenty Thousand One Hundred Ninety-Two

Basics

Value: -20193 → -20192 → -20191

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ⁵ × 631

Divisors: 1, 2, 4, 8, 16, 32, 631, 1262, 2524, 5048

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100111011100000

Octal: -47340

Duodecimal: -B828

Hexadecimal: -4ee0

Square: 407716864

Square Root: 142.09855734665288

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

Triangle read by rows, a generalization of the Eulerian numbers based on Nielsen's generalized polylogarithm (case m = 3). A293298

Number of regions formed by drawing the lines connecting any two of the 2*(n+2) perimeter points of a 3 X (n+1) rectangular grid of points (or equally, a 2 X n grid of squares). A331766

Expansion of 1/(1 - ∑_k>=1 k!*x^k*(k+1/2) / ∏_j=1..k (1 - x^j)). A307068

Sequence defined by a(1)=a(2)=1 and a(n) = gray(gray(a(n-1)) + gray(a(n-2))), with gray(m) = A003188(m). A265386

Number of odd composites below 10ⁿ that are congruent to 3 modulo 4. A93152

Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n containing k subwords of the type uh^ju, dH^jd, or dh^ju for some j>0, where u=(1,1), d=(1,-1) and h=(1,0) (can be easily expressed using RNA secondary structure terminology). A98056

Expansion of φ(x) / ψ(x²)² in powers of·where φ(), ψ() are Ramanujan θ functions. A232166

a(n) = a(n-2) + a(n-3) + a(n-4) for n>3, a(0)=1, a(1)=a(2)=0, a(3)=2. A277253