Properties of the Number -55807

Fifty-Five Thousand Eight Hundred Seven

Basics

Value: -55808 → -55807 → -55806

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 55807

Divisors: 1, 55807

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1101100111111111

Octal: -154777

Duodecimal: -28367

Hexadecimal: -d9ff

Square: 3114421249

Square Root: 236.23505243718597

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(n) = 3·a(n-1) + a(n-2), with a(1)=1 and a(2)=4. A3688

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with each 2X2 subblock having clockwise pattern 0000 0001 0011 or 0111. A259427

Fixed-j dispersion for Q = 13: array D(g,h) (g, h >= 1), read by ascending antidiagonals. A120862

Smallest primes of 3 X 3 semimagic squares formed from consecutive primes. A265139

A089450 indexed by A000040. A89525

Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 483", based on the 5-celled von Neumann neighborhood. A288591

If a(n-1) is not a prime, then a(n) = 2·a(n-1) + S; otherwise set S = -S and a(n) = prime(n) + S; start with a(1) = S = 1. A373805

Primes in A373805 in order of their occurrence. A373806

a(n) = floor(sqrt(a(n-1)² + a(n-2)²)), a(1)=10, a(2)=30. A104863

List of quadruples (r,s,t,u): the matrix M = [[4,12,9][2,5,3][1,2,1]] is raised to successive powers, then (r,s,t,u) are the square roots of M[3,1], M[3,3], M[1,1], M[1,3] respectively. A249579