Properties of the Number -36960

Thirty-Six Thousand Nine Hundred Sixty

Basics

Value: -36961 → -36960 → -36959

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ⁵ × 3 × 5 × 7 × 11

Divisors: 1, 2, 3, 4, 5, 6, 7, 8, 10, 11

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1001000001100000

Octal: -110140

Duodecimal: -19480

Hexadecimal: -9060

Square: 1366041600

Square Root: 192.24983745116666

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

Array: row n shows the coefficients of the characteristic polynomial of the n-th principal submatrix of max(2i-1, 2j-1) (A204022). A204023

Hurwitz logarithm of Catalan numbers [1,1,2,5,14,...]. A302197

Expansion of f(-q³)² * Q(q³) + 48·q * f(-q³)¹⁰ in powers of q. A234565

Triangle T(n,k) = n!/(n - k)! + n!/k! - n! read by rows, 0 <= k <= n. A177974

Expansion of e.g.f. 1 / (1 - x + x²/2 - x³/3 + x⁴/4). A371621

A certain partition array in Abramowitz-Stegun order (A-St order), called M₃(6). A134278

Triangle read by rows: T(n,k) = 2^n-k*prime(k)#, 1 <= k <= n, where prime(k)# is the product of first k primes. A303555

a(n) = n*(n+1)*(5·n+1)/6. A33994

Numbers k that divide the number of partitions of k into distinct parts (A000009). A56848

Triangle read by rows where T(n,k) is the number of labeled loop-graphs on n vertices with k loops and n-k non-loops such that it is possible to choose a different vertex from each edge. A368924