Properties of the Number -2036

Thirty-Six

Basics

Value: -2037 → -2036 → -2035

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 509

Divisors: 1, 2, 4, 509, 1018, 2036

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: -11111110100

Octal: -3764

Duodecimal: -1218

Hexadecimal: -7f4

Square: 4145296

Square Root: 45.12205669071391

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

Triangle read by rows: T(n,k) is the coefficient A_k in the transformation of 1 + x + x² + ... + xⁿ to the polynomial A_k*(x+3)^k for 0 <= k <= n. A248811

Inverse of a triangle of pyramidal numbers. A110814

Triangle T(n, k) = ∑_j=0..k (-1)^k-j*A159041(2·n+1, j), read by rows. A225483

G.f.: ∏_i>=1 (1 - 2*(-x)ⁱ)/(1 - (-x)ⁱ)². A104510

Riordan array T((1-x)^-2 | 2x-1) read by rows. A181690

Riordan array (1/(1+2x), x/(1+x)). A103316

Eulerian numbers (Euler's triangle: column k=2 of A008292, column k=1 of A173018). A295

Triangle read by rows of partial sums of binomial coefficients: T(n,k) = ∑_i=0..k binomial(n,i) (0 <= k <= n); also dimensions of Reed-Muller codes. A8949

Number of pairwise coprime strict compositions of n, where a singleton is not considered coprime unless it is (1). A337561

Number of perfect rulers with length n. A103300