Properties of the Number -36840

Thirty-Six Thousand Eight Hundred Forty

Basics

Value: -36841 → -36840 → -36839

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 5 × 307

Divisors: 1, 2, 3, 4, 5, 6, 8, 10, 12, 15

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1000111111101000

Octal: -107750

Duodecimal: -193A0

Hexadecimal: -8fe8

Square: 1357185600

Square Root: 191.93748982416125

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

Consider the Diophantine equation x³ + y³ = z³ - 1 (x < y < z) or 'Fermat near misses'. The values of z (see A050787) are arranged in monotonically increasing order. Sequence gives values of y. A50789

a(n) is the number of edges formed by n-secting the angles of an octagon. A335771

T(n,k) is the number of connected labeled posets with n elements and rank k: triangle read by rows. A342501

Number of edges in a regular 2n-gon when all vertices are connect by straight lines except for the n lines joining diametrically opposite vertices. A368815

a(n) = 64·n² - n. A157948

a(n) = 256·n² - 2·n. A158249

Numbers n such that σ(σ(n))/σ(n) > σ(σ(m))/σ(m) for all m < n. A289124

Number of integer partitions of n with exactly two distinct multiplicities. A325243

a(n) = 576·n² - 24. A158636

Number of n X n 0..4 arrays with row sums 5 and column sums 5. A172809