Properties of the Number -51941

Fifty-One Thousand Nine Hundred Forty-One

Basics

Value: -51942 → -51941 → -51940

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 51941

Divisors: 1, 51941

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1100101011100101

Octal: -145345

Duodecimal: -26085

Hexadecimal: -cae5

Square: 2697867481

Square Root: 227.9056822459677

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

Primes from merging of 5 successive digits in decimal expansion of π. A104825

T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 2 or 4 king-move neighboring 1s. A296039

Cyclotomic polynomials Phi_n at x=φ, rounded to nearest integer (where φ = τ = (sqrt(5)+1)/2). A63705

Cyclotomic polynomials Phi_n at x=φ, ceiled up (where φ = τ = (sqrt(5)+1)/2). A63707

Smallest prime that generates a prime pyramid of height n. A34276

Number of nX5 0..1 arrays with each 1 adjacent to 2 or 4 king-move neighboring 1s. A296036

Number of nX6 0..1 arrays with each 1 adjacent to 2 or 4 king-move neighboring 1s. A296037

An 8th-degree product form sequence: a(n)=Product[(1 + 4·Sin[k*π/n]² + 16·Sin[k*π/n]⁴ + 64·Sin[k*π/n]⁶ + 256·Sin[k*π/n]⁸), {k, 1, Floor[(n - 1)/2]}]. A152144

Primes p in A068209 whose squares never divide (x+1)^p-x^p-1 and x^x+(x+1)^x+1 for the same x. A165284

First primes beginning a chain of 4 primes indexed equidistantly (n-th, (n+b)-th, (n+2b)-th, (n+3b)-th primes) whose sum of squares is the square of two times a prime and with b <= n. A214265