Properties of the Number -37739

Thirty-Seven Thousand Seven Hundred Thirty-Nine

Basics

Value: -37740 → -37739 → -37738

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 13 × 2903

Divisors: 1, 13, 2903, 37739

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1001001101101011

Octal: -111553

Duodecimal: -19A0B

Hexadecimal: -936b

Square: 1424232121

Square Root: 194.2652825391094

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

T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 3, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero. A300146

Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and vertical height (i.e., number of rows) k (1 <= k <= n). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column. A121692

G.f. A(x) satisfies: A(x) = x + x² + x³ * (1 + A(A(x))). A308030

a(n) = Motzkin(n) - 2^{n - 1 + 0ⁿ} = A001006(n) - A011782(n). A377659

When squared gives number composed just of the digits 1, 2, 3, 4. A61677

Number of nX4 0..1 arrays with every element equal to 1, 3, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero. A300142

Number of nX7 0..1 arrays with every element equal to 1, 3, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero. A300145