10559
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 10560
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10558
- Möbius Function
- -1
- Radical
- 10559
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 78
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- yes
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1289
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) is the least number m such that the n-th prime is the least quadratic nonresidue modulo m.at n=8A000229
- Erroneous version of A045535.at n=7A001984
- Smallest prime p of form p = 8k-1 such that first n primes (p_1=2, ..., p_n) are quadratic residues mod p.at n=7A002223
- Numbers whose least quadratic nonresidue (A020649) is 23.at n=0A025028
- a(n) is the least odd prime p such that the maximum run length of consecutive quadratic residues modulo p is n.at n=21A025046
- Least negative pseudosquare modulo the first n odd primes.at n=7A045535
- Let prime(i) = i-th prime, let twin(n) = (P,Q) be n-th pair of twin primes; sequence gives prime(P).at n=43A057470
- Primes with 23 as smallest positive primitive root.at n=2A061335
- Smallest integer >= 2 that is not the sum of 2 positive integers whose prime factors are all <= p(n), the n-th prime.at n=8A062241
- Expansion of q^(-1/6) * eta(q^2)^3 / eta(q)^2 in powers of q.at n=48A085140
- Choose a(n) so that 2*3*5*13*...*a(n) - 1 is prime; a(n) is prime; and a(n) > a(n-1).at n=43A087898
- a(n) = r-th prime of the form (p-q)/(q-r) with r=prime(n+1), q=prime(n+2), and primes p > q.at n=43A089577
- a(n) = prime(A096475(n)).at n=12A096476
- Smallest prime p such that the maximum run length of consecutive positive quadratic residues modulo p is n.at n=21A097159
- 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.at n=53A112070
- Transpose of A112070.at n=46A112071
- Odd numbers k for which 23 is the smallest positive i with Jacobi symbol J(i,k) != 1.at n=1A112079
- Column 2 of A112070.at n=8A112084
- Least prime p such that sigma(x)=sigma(p) has exactly n solutions.at n=19A115374
- Primes which are the sum of a twin prime pair - 1.at n=38A118072