Properties of the Number -37040

Thirty-Seven Thousand Forty

Basics

Value: -37041 → -37040 → -37039

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ⁴ × 5 × 463

Divisors: 1, 2, 4, 5, 8, 10, 16, 20, 40, 80

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1001000010110000

Octal: -110260

Duodecimal: -19528

Hexadecimal: -90b0

Square: 1371961600

Square Root: 192.45778757951052

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 (n+1)X(k+1) 0..1 arrays x(i,j) with row sums sum{j³*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i³*x(i,j), i=1..n+1} nondecreasing. A232860

Triangle read by rows: T(n, k) = n! * 3^k * hypergeom([-k], [-n], -2/3). A375597

Number of (n+1)X(3+1) 0..1 arrays x(i,j) with row sums sum{j³*x(i,j), j=1..3+1} nondecreasing, and column sums sum{i³*x(i,j), i=1..n+1} nondecreasing. A232856

Number of cyclotomic cosets of 9 mod 10ⁿ. A220020

Let P be a one-move "rider" with move set M={(1,2)}; a(n) is the number of non-attacking positions of three indistinguishable pieces P on an n X n board. A222309

Number of (n+1)X(6+1) 0..1 arrays x(i,j) with row sums sum{j³*x(i,j), j=1..6+1} nondecreasing, and column sums sum{i³*x(i,j), i=1..n+1} nondecreasing. A232859

Multiples of 1852. A303272