Properties of the Number -90751

Ninety Thousand Seven Hundred Fifty-One

Basics

Value: -90752 → -90751 → -90750

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 151 × 601

Divisors: 1, 151, 601, 90751

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -10110001001111111

Octal: -261177

Duodecimal: -44627

Hexadecimal: -1627f

Square: 8235744001

Square Root: 301.2490663885948

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

Strong pseudoprimes to base 2. A1262

Euler-Jacobi pseudoprimes: 2^(n-1/2) == (2 / n) mod n, where (2 / n) is a Jacobi symbol. A47713

Super-Poulet numbers: Poulet numbers whose divisors d all satisfy d∣2^d-2. A50217

Composite numbers k such that k == +-1 (mod 8) and 2^(k-1/2) == 1 (mod k). A6971

Pseudoprimes to both base 2 and base 3, i.e., intersection of A001567 and A005935. A52155

Fermat pseudoprimes to base 2 with two prime factors. A214305

Strong pseudoprimes to base 4. A20230

Composite numbers k such that 2^k-2 and 3^k-3 are both divisible by k and k is not a Carmichael number (A002997). A153513

Largest n-digit strong pseudoprimes (in base 2). A62852

Numbers to which Mersenne primes 2^p-1 can be congruent mod k! (for k > 1). A145038