Properties of the Number -36853

Thirty-Six Thousand Eight Hundred Fifty-Three

Basics

Value: -36854 → -36853 → -36852

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 137 × 269

Divisors: 1, 137, 269, 36853

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1000111111110101

Octal: -107765

Duodecimal: -193B1

Hexadecimal: -8ff5

Square: 1358143609

Square Root: 191.9713520294109

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

E.g.f. B = B(x,y) satisfies: A² + B² + C² = 1 + y² and A³ + B³ + C³ = 1 + y³, where functions A = A(x,y) and C = C(x,y) are described by A278885 and A278887, respectively. A278886

E.g.f. C = C(x,y) satisfies: A² + B² + C² = 1 + y² and A³ + B³ + C³ = 1 + y³, where functions A = A(x,y) and B = B(x,y) are described by A278885 and A278886, respectively. A278887

Numbers n such that n and prime(n) end with the same three digits. A67841

Number of Dyck paths of semilength n such that all positive levels up to the highest level have a positive number of peaks and all the level peak numbers are distinct. A287993

(n - φ(n)) | σ(n) for composite n not congruent to 2 (mod 4). A55164

Nearest integer to log(nⁿ)^log(n). A62432

Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 1010-1111-0101 pattern in any orientation. A147429

Numbers m such that ψ(x) = φ(m) has a solution while σ(y) = φ(m) has none. A291524