Properties of the Number -51841

Fifty-One Thousand Eight Hundred Forty-One

Basics

Value: -51842 → -51841 → -51840

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 47 × 1103

Divisors: 1, 47, 1103, 51841

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1100101010000001

Octal: -145201

Duodecimal: -26001

Hexadecimal: -ca81

Square: 2687489281

Square Root: 227.6861875476859

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

Numerators of continued fraction convergents to sqrt(5). A1077

a(n) = 18·a(n-1) - a(n-2), with a(0) = 1 and a(1) = 9. A23039

Bruckman-Lucas pseudoprimes: k | (L_k - 1), where k is composite and L_k = Lucas numbers A000032. A5845

Odd Fibonacci pseudoprimes: odd composite numbers k such that either (1) k divides Fibonacci(k-1) if k == +-1 (mod 5) or (2) k divides Fibonacci(k+1) if k == +-2 (mod 5). A81264

Numbers such that floor(a(n)² / 5) is a square. A204520

Array of ((kⁿ)+(k^-n))/2 where k=(sqrt(x²+1)+x)² for integers x>=1. A188645

Composite numbers k such that k divides F(k-1) where F(j) are the Fibonacci numbers. A69106

a(n) = ChebyshevT(4, n). A144130

Composite n coprime to 5 such that Fibonacci(n) == Legendre(n,5) (mod n). A49062

Consider the mapping f(r) = (1/2)*(r + N/r) from rationals to rationals where N = 5. Starting with r = 2 and applying the mapping to each new (reduced) rational number gives 2, 9/4, 161/72, 51841/23184, ..., tending to N^1/2. Sequence gives values of the numerators. A81459