Properties of the Number -2106

One Hundred Six

Basics

Value: -2107 → -2106 → -2105

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ⁴ × 13

Divisors: 1, 2, 3, 6, 9, 13, 18, 26, 27, 39

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -100000111010

Octal: -4072

Duodecimal: -1276

Hexadecimal: -83a

Square: 4435236

Square Root: 45.89117562233506

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

Result of using the positive integers 1,2,3,... as coefficients in an infinite polynomial series in·and then expressing this series as ∏_k>=1 (1+a(k)x^k). A147654

Low-temperature magnetization expansion for hexagonal lattice (Potts model, q=3). A57382

Expansion of ∏_k>0 (1 - x^k)^4·k. A316463

6 times triangular numbers: a(n) = 3·n*(n+1). A28896

Write 1 - x/(1-x) as an inverse power product 1/(1 + a(1)*x) * 1/(1 + a(2)*x²) * 1/(1 + a(3)*x³) * 1/(1 + a(4)*x⁴) * ... A290261

Express 1 - x - x² - x³ - x⁴ - ... as product (1 + g(1)*x) * (1 + g(2)*x²) *(1 + g(3)*x³) * ... and use a(n) = - g(n). A220418

a(n) = 3·n*(n + 3)/2. A140091

Number of partitions of n such that (number of distinct parts) = maximal multiplicity of the parts. A239964

Number of length n inversion sequences avoiding the patterns 100, 101, and 201. A279571

Subdiagonal partitions: number of partitions (p1, p2, p3, ...) of n with π <= i. A238875