Properties of the Number -36825

Thirty-Six Thousand Eight Hundred Twenty-Five

Basics

Value: -36826 → -36825 → -36824

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 ² × 491

Divisors: 1, 3, 5, 15, 25, 75, 491, 1473, 2455, 7365

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1000111111011001

Octal: -107731

Duodecimal: -19389

Hexadecimal: -8fd9

Square: 1356080625

Square Root: 191.89841062395487

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

sech(sec(x)*arcsinh(x))=1-1/2!*x²-3/4!*x⁴-45/6!*x⁶+2457/8!*x⁸... A12833

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock summing to 2 3 4 5 or 6. A251390

a(n) = (1/7) * ∑_k=0..n-1 binomial(7·n,7·k+1). A387748

a(n) = ∑_{i+j+k=n, i,j,k >= 1} τ(i)*τ(j)*τ(k), where τ() = A000005(). A191829

Number of partitions of n whose greatest part is a multiple of 4. A363046

Number of (n+1) X (1+1) 0..2 arrays with every 2 X 2 subblock summing to 2 3 4 5 or 6. A251383

Number of (n+1)X(4+1) 0..2 arrays with every 2X2 subblock summing to 2 3 4 5 or 6. A251386