Properties of the Number 10559

Ten Thousand Five Hundred Fifty-Nine

Basics

Value: 10558 → 10559 → 10560

Parity: odd

Prime: Yes

Previous Prime: 10531

Next Prime: 10567

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 10559

Divisors: 1, 10559

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10100100111111

Octal: 24477

Duodecimal: 613B

Hexadecimal: 293f

Square: 111492481

Square Root: 102.75699489572474

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 with 23 as smallest positive primitive root. A61335

Smallest prime p of form p = 8k-1 such that first n primes (p₁=2, ..., p_n) are quadratic residues mod p. A2223

Square array A(x,y) = y-th odd number 2i+1 (i>=1) for which A112049(2i+1)=x, or 0 if no such i exists; read by descending antidiagonals. A112070

Least negative pseudosquare modulo the first n odd primes. A45535

a(n) is the least number m such that the n-th prime is the least quadratic nonresidue modulo m. A229

Numbers whose least quadratic nonresidue (A020649) is 23. A25028

Expansion of q^-1/6 * η(q²)³ / η(q)² in powers of q. A85140

Let prime(i) = i-th prime, let twin(n) = (P,Q) be n-th pair of twin primes; sequence gives prime(P). A57470

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

Primes of the form 64n+63. A127579