Properties of the Number -36451

Thirty-Six Thousand Four Hundred Fifty-One

Basics

Value: -36452 → -36451 → -36450

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 36451

Divisors: 1, 36451

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1000111001100011

Octal: -107143

Duodecimal: -19117

Hexadecimal: -8e63

Square: 1328675401

Square Root: 190.9214498164101

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 2·n²+1. A90698

Denominators of upper primes-only best approximates (POBAs) to sqrt(8); see Comments. A265793

Primes of the form p = prime(k) = (prime(k+3)+prime(k-1))/2. A126238

Primes p such that x⁵ = 2 has a solution mod p, but x^5² = 2 has no solution mod p. A70182

Let M = the 2 X 2 matrix [0 1 / -1 2+sqrt(8)]. Perform the operation Mⁿ * [1 1] = [x y]; then a(n) = floor(x), a(n+1) = floor(y). A93568

a(n) = 50·n² + 1. A157916

Fourth prime p such that (p+n)²+n is prime but (p+j)²+j is not prime for all 0<j<n. A238676

Primes p such that p³-2 and p²-2 are both primes. A242979

Primes p such that both 2p-1 and 2p²-2p+1 are prime. A274609

a(n) is the smallest prime p such that the number of distinct values of the ratio (number of nonnegative m < p such that m^k == m (mod p))/(number of nonnegative m < p such that -m^k == m (mod p)) is equal to n for some nonnegative k. A340281