Properties of the Number -3736

Seven Hundred Thirty-Six

Basics

Value: -3737 → -3736 → -3735

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 467

Divisors: 1, 2, 4, 8, 467, 934, 1868, 3736

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -111010011000

Octal: -7230

Duodecimal: -21B4

Hexadecimal: -e98

Square: 13957696

Square Root: 61.1228271597445

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

Matrix inverse of triangle A121336, where A121336(n,k) = C( n*(n+1)/2 + n-k + 2, n-k) for n>=k>=0. A121441

Expansion of (1-x)^-1/(1 + x - x² + x³). A77902

G.f. A(x) satisfies: (1 + x)/(1 - x) = A(x)*A(x²)²*A(x³)³*A(x⁴)⁴* ... *A(x^k)^k* ... A307659

Derivative of log of A007360. A23892

Triangle of Mahonian numbers T(n,k): coefficients in expansion of ∏_i=0..n-1 (1 + x + ... + xⁱ), where k ranges from 0 to A000217(n-1). Also enumerates permutations by their major index. A8302

a(n) = ∑_k=0..n T(k) where T(n) are the tribonacci numbers A000073. A8937

Fibonacci-Pascal triangle read by rows. A36355

Numbers k such that the largest prime factor of k²-1 is 101. A181568

Triangle G(n,k) read by rows, for 0 <= k <= n, where G(n, 0) = G(n+1, n+1) = 1, G(n+2, n+1) = 2, G(n+3, n+1) = 4, and G(n+4, m) = G(n+1, m-1) + G(n+1, m) + G(n+2, m) + G(n+3, m) for n >= 0 and m = 1..n+1. A140997

Coefficients in expansion of ∑_{n >= 1} xⁿ/(1-xⁿ)⁴. A59358