Properties of the Number -53791

Fifty-Three Thousand Seven Hundred Ninety-One

Basics

Value: -53792 → -53791 → -53790

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 53791

Divisors: 1, 53791

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

375 Try Today's Challenge

Representations

Binary: -1101001000011111

Octal: -151037

Duodecimal: -27167

Hexadecimal: -d21f

Square: 2893471681

Square Root: 231.92886840581102

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

G.f. satisfies x = A(x)*(1-A(x))/(1-A(x)-(A(x))²). A108623

G.f. satisfies x = A(x)*(1+A(x))/(1-A(x)-(A(x))²). A108624

Expansion of 1/(x + sqrt(1-4x)). A81696

T(n,k) is the number permutations p of [n] that are k-dist-increasing but not j-dist-increasing for any j<k, where p is j-dist-increasing if j>=0 and p(i)<p(i+j) for all i in [n-j]; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A370507

Primes of the form 8·k² - 1. A90684

Riordan array (1/(1 - x·c(x) - x²*c(x)²), x·c(x)) where c(x) is the g.f. of A000108. A109267

a(n) = 32·n² - 1. A158563

Extrapolation for (n + 1)-st odd prime made by fitting least-degree polynomial to first n odd primes. A140118

Number of lattice paths from (0,0) to (i,n-2·i) that do not go above the diagonal x=y using steps in {(1,0), (0,1)}. A357654

Sum of the legs of the unique primitive Pythagorean triple whose inradius is the n-th prime and whose short leg is an odd number. A382097