Properties of the Number -52889

Fifty-Two Thousand Eight Hundred Eighty-Nine

Basics

Value: -52890 → -52889 → -52888

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 32

Digital Root: 5

Palindrome: No

Factorization: 52889

Divisors: 1, 52889

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -1100111010011001

Octal: -147231

Duodecimal: -26735

Hexadecimal: -ce99

Square: 2797246321

Square Root: 229.97608571327584

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

Number of unimodal functions [1..n]->[0..2]. A223718

T(n,k)=Number of nXk 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 0, 1 or 4 neighboring 1s. A297682

G.f.: 1/(1 - x/(1 - x⁴/(1 - x⁹/(1 - x¹⁶/(1 - x²⁵/(1 - x³⁶/(1 -...- x^n²/(1 -...))))))), a continued fraction. A206739

Generalized Fibonacci numbers A_n,6. A208092

Primes of the form n² - 11. A91272

Lexicographically largest increasing sequence of primes for which the continued square root map (see A257574) produces π. A257582

Consider primes p such that integer part of the volume of cube with faces of area p is prime; sequence gives integer part of volumes. A107989

Fajtlowicz p-primes. A185955

Sum of terms of A293630 after generating the sequence for n steps (see comments). A298590

a(n) = gpf(1 + ∏_k=0..4 prime(n+k)), where gpf is greatest prime factor and prime(i) is the i-th prime. A261210