Properties of the Number -106819

One Hundred Six Thousand Eight Hundred Nineteen

Basics

Value: -106820 → -106819 → -106818

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 37 × 2887

Divisors: 1, 37, 2887, 106819

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11010000101000011

Octal: -320503

Duodecimal: -51997

Hexadecimal: -1a143

Square: 11410298761

Square Root: 326.8317610025072

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) = 7ⁿ - 3·4ⁿ + 2·3ⁿ. A2501

Number of connected relations. A93733

Array read by antidiagonals: T(m,n) = number of m X n binary matrices with all 1's connected and no zero rows or columns. A262307

Number T(n,k) of ways k L-tiles can be placed on an n X n square; triangle T(n,k), n>=0, 0<=k<=A229093(n), read by rows. A243608

Triangle read by rows: T(n,k) = number of specially labeled bicolored connected graphs with k points in one color class and n-k points in the other class . "Special" means there are separate labels 1,2, ...,k and 1,2, ...,n-k for the two color classes (n >= 1, k = floor((n+1)/2), ..., n). A123260

T(n,k)=Number of nXk 0..4 arrays of sums of 2X2 subblocks of some (n+1)X(k+1) binary array. A226658

Triangle read by rows: T(n, m) for 0 <= m <= n is the number of bipartite connected labeled graphs with parts of size n and m. A227322

Number of ways four L-tiles can be placed on an n X n square. A243647