Properties of the Number -37180

Thirty-Seven Thousand One Hundred Eighty

Basics

Value: -37181 → -37180 → -37179

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 5 × 11 × 13 ²

Divisors: 1, 2, 4, 5, 10, 11, 13, 20, 22, 26

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1001000100111100

Octal: -110474

Duodecimal: -19624

Hexadecimal: -913c

Square: 1382352400

Square Root: 192.82116066448722

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

Consider primitive pairs of integers (b, c) with b < 0 such that x⁵ + b·x + c = 0 is irreducible and solvable by radicals: sequence gives values of b. A371557

Coefficient array for powers of x² of the square of Chebyshev's C(2·n+1,x)/x =: τ(n,x) polynomials. A220669

a(n) = binomial(n+7, 7)*(n+4)/4. A53347

a(n) = C(n)*(3n+2) where C(n) = Catalan numbers = A000108. A51960

Sum of the squarefree parts of the partitions of n into 8 parts. A309484

a(0) = 1; for n > 0, a(n) = binomial(n, floor(n/2)) + binomial(n-1, floor(n/2)). A50168

Partial sums of A051946. A50484

Number of orbits of the 5-step recursion mod n. A106287

Number of partitions of n+5 with largest inscribed rectangle having area <= n. A218626

Triangle read by rows: number of (1-2-3)-avoiding permutations on n letters with k peaks. A236406