Properties of the Number -36721

Thirty-Six Thousand Seven Hundred Twenty-One

Basics

Value: -36722 → -36721 → -36720

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 36721

Divisors: 1, 36721

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1000111101110001

Octal: -107561

Duodecimal: -19301

Hexadecimal: -8f71

Square: 1348431841

Square Root: 191.62724232217087

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 of the form j² + (j+1)². A27862

Prime hypotenuses of Pythagorean triangles with a prime leg. A67756

Smallest prime having least positive primitive root n, or 0 if no such prime exists. A23048

Primes with record values of the least positive primitive root. A2230

Number of permutations (p(1),p(2),...,p(n)) of (1,2,...,n) such that p(i)-i is in {-2,-1,4} for all i=1,...,n. A376743

Let m = n-th number that is not a perfect power, A007916(n). Then a(n) = smallest prime having least positive primitive root m. A133432

Primes of the form 50n² + 10n + 1. A154428

Numbers k such that -3 is a quadratic residue (not necessarily coprime) modulo k, k + 1, k + 2 and k + 3. A318527

Lexicographically earliest sequence of numbers whose partial products are all Fermat pseudoprimes to base 2 (A001567). A374027

a(n) is the smallest positive integer which can be represented as the sum of n distinct nonzero square pyramidal numbers in exactly n ways, or -1 if no such integer exists. A360218