Properties of the Number -1006003

Six Thousand Three

Basics

Value: -1006004 → -1006003 → -1006002

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 1006003

Divisors: 1, 1006003

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7989 Try Today's Challenge

Representations

Binary: -11110101100110110011

Octal: -3654663

Duodecimal: -406217

Hexadecimal: -f59b3

Square: 1012042036009

Square Root: 1002.997008968621

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

Mirimanoff primes: primes p such that p² divides 3^p-1 - 1. A14127

GCDs arising in A126196. A126197

Least prime p such that (p,q) is a Double Wieferich prime pair for q=A124121(n). A124122

Numbers n such that 3^φ(n) == 1 (mod n²), where φ(n) is Euler's totient function. A242958

2nd Wieferich prime base prime(n). A178871

Primes p that set a new record for the number of bases 1 < b < p for which p is a base-b Wieferich prime. A248865

Primes p such that a prime q < p exists with p^q-1 == 1 (mod q²) and q^p-1 == 1 (mod p²), i.e., primes that are the larger member of a double Wieferich prime pair. A266829

Primes p that satisfy q^p-1 == 1 (mod p²), i.e., are base-q Wieferich primes, for a prime q dividing p-1. A355545

Primes p such that ω(p + 1)^{p - 1} == 1 (mod p²), where ω is A001222. A306909

Smallest prime p such that there exist exactly n integers b such that 1 < b < p and b^p-1 == 1 (mod p²) or, equivalently, Fermat quotient q_p(b) == 0 (mod p). A175932