Properties of the Number -3836

Eight Hundred Thirty-Six

Basics

Value: -3837 → -3836 → -3835

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 7 × 137

Divisors: 1, 2, 4, 7, 14, 28, 137, 274, 548, 959

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -111011111100

Octal: -7374

Duodecimal: -2278

Hexadecimal: -efc

Square: 14714896

Square Root: 61.93545026880809

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, e.g.f. exp(x·z)/((exp(x/2)+exp(x·3/2))/((exp(3·x/2)+2·cos(sqrt(3)*x/2))/3)-1). A215065

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of e.g.f. B(x)^k, where B(x) is the e.g.f. of A384856. A384860

Expansion of sin(tanh(x))*x/2. A24273

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(1)=1, a(n)=a(n-1)+n if n even, a(n)=a(n-1)+n² if n is odd. A136047

Triangle read by rows: T(n,k) are the coefficients of Charlier polynomials: A046716 transposed, for 0 <= k <= n. A94816

Numbers n such that Bernoulli number B_n has denominator 870. A272185

Kendall-Mann numbers: the most common number of inversions in a permutation on n letters is floor(n*(n-1)/4); a(n) is the number of permutations with this many inversions. A140

Coefficients of a special case of Poisson-Charlier polynomials. A46716

a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 3 - 2^p+1 and p is the smallest integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = a(2) = a(3) = 1. A50024