Properties of the Number -66136

Sixty-Six Thousand One Hundred Thirty-Six

Basics

Value: -66137 → -66136 → -66135

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ³ × 7 × 1181

Divisors: 1, 2, 4, 7, 8, 14, 28, 56, 1181, 2362

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10000001001011000

Octal: -201130

Duodecimal: -32334

Hexadecimal: -10258

Square: 4373970496

Square Root: 257.16920499935446

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

Expansion of (1 - x + x²)/(1 - x - x⁴). A103632

Losing initial positions in game: two players alternate in removing >= 1 stones; last player wins; first player may not remove all stones; each move <= 3 times previous move. A3411

Expansion of ∏_{1 <= i₁ <= i₂ <= i₃ <= i₄} (1 + x^{i₁*i₂*i₃*i₄}). A321567

Expansion of 1/(1 - x - x² + x³ - x⁴ + x⁶). A193146

G.f. = b(2)*b(4)*b(6)/(x⁹+x⁸+x⁷+x⁶-x⁵-x⁴-x³-x²-x+1), where b(k) = (1-x^k)/(1-x). A266372

Smallest losing position after your opponent has taken k stones in a variation of "Fibonacci Nim". A54736

a(n)=the sum of the (1,2)- and (1,3)-entries and twice the (1,4)-entry of the matrix Pⁿ + Tⁿ, where the 4 X 4 matrices P and T are defined by P=[0,1,0,0;0,0,1,0;0,0,0,1;1,0,0,0] and T=[0,1,0,0;0,0,1,0;0,0,0,1;1,0,0,1]. A109526