Properties of the Number -90313

Ninety Thousand Three Hundred Thirteen

Basics

Value: -90314 → -90313 → -90312

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 90313

Divisors: 1, 90313

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -10110000011001001

Octal: -260311

Duodecimal: -44321

Hexadecimal: -160c9

Square: 8156437969

Square Root: 300.5212138934621

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 p such that q-p = 40, where q is the next prime after p. A126721

T(n,k)=Number of nXk 0..1 arrays with every element equal to 2, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero. A299554

Smallest prime p such that the maximum run length of consecutive positive quadratic residues modulo p is n. A97159

a(n) is the least odd prime p such that the maximum run length of consecutive quadratic residues modulo p is n. A25046

Primes that are concatenations of k-th composite and k-th prime. A38532

Starting from 1, successively take the smallest "Choix de Bruxelles" with factor 13 which is not already in the sequence. A360190

Primes of the form 8·n² + 4·n + 1. A102130

a(0)=113, then a(n) = smallest prime p not already used such that the first three digits of p = the last three digits of a(n-1). A175687

Number of nX3 0..1 arrays with every element equal to 2, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero. A299549