Properties of the Number -2133

One Hundred Thirty-Three

Basics

Value: -2134 → -2133 → -2132

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 79

Divisors: 1, 3, 9, 27, 79, 237, 711, 2133

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -100001010101

Octal: -4125

Duodecimal: -1299

Hexadecimal: -855

Square: 4549689

Square Root: 46.184412955021955

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) = (-n³ + 9n² - 5n + 3)/3. A161702

First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 113", based on the 5-celled von Neumann neighborhood. A270180

Dirichlet g.f.: ζ(s-3)² * (1 - 2^4-s) / ζ(s). A369101

Expansion of (1-x)^-1/(1+x+x²-2·x³). A77907

A triangle sequence from matrix polynomials of a three symbol type {0, 1, 2}: c(i,k)= Floor[Mod[i/2^k, 2]]; M(d)=Table[If[Sum[c(n, k)*c(m, k), {k, 0, d - 1}] == 0, 1, If[Sum[c(n, k)*c(m, k), {k, 0, d - 1}] == 1, 2, 0]], {n, 0, d - 1}, {m, 0, d - 1}]. A158418

Octagonal numbers: n*(3·n-2). Also called star numbers. A567

V-toothpick (or honeycomb) sequence (see Comments lines for definition). A161206

Number of integer partitions of n whose negated run-lengths are not unimodal. A332639

Numbers k such that k, k+1 and k+2 have the same number of divisors. A5238

Triangle T(n,k), 0 <= k <= n, read by rows, defined by: T(0,0) = 1, T(n,k) = 0 if n<k, T(n,0) = T(n-1,0) + T(n-1,1) and for k >= 1: T(n,k) = T(n-1,k-1) + x·T(n-1,k) + T(n-1,k+1) with x = 3. A110877