Properties of the Number -51971

Fifty-One Thousand Nine Hundred Seventy-One

Basics

Value: -51972 → -51971 → -51970

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 51971

Divisors: 1, 51971

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1100101100000011

Octal: -145403

Duodecimal: -260AB

Hexadecimal: -cb03

Square: 2700984841

Square Root: 227.97148944550062

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

a(1) = greatest k such that H(k) - H(2) < 1/1 + 1/2; a(2) = greatest k such that H(k) - H(a(1)) < H(a(1)) - H(2); and for n>2, a(n) = greatest k such that H(k) - H(a(n-1)) < H(a(n-1)) - H(a(n-2)), where H = harmonic number. A227728

Primes of the form n² - 13. A154648

Primes with all odd digits such that the next three primes also contain all odd digits. A68831

a(n) is the first prime p such that the concatenations of n consecutive primes, starting with p, in both forward and backward directions, are prime. A384958

Primes k such that the concatenation of (b, k, b) and (k, b, k) are both prime, where b is the binary representation of k. A389801

Lower of twin primes (p,p+2) such that (p*(p+2))² + p² - (p+2)² and (p*(p+2))² - p² + (p+2)² are both prime. A79812

A triangle sequence based on a prime root product using a primorial function: f(n)=primorial(n); p(x,n)=If[n == 0, 1, f(n)*(x + 1/f(n))*Product[x + Prime[i], {i, 1, n - 1}]]; t(n,m)=coefficients(p(x,n)). A142583