11579
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 11580
- 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
- 11578
- Möbius Function
- -1
- Radical
- 11579
- 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
- 50
- 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
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1393
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 98.at n=11A020437
- Primes that remain prime through 3 iterations of function f(x) = 5x + 6.at n=32A023285
- Primes that remain prime through 3 iterations of function f(x) = 8x + 7.at n=7A023294
- Smallest number m with nonzero digits such that A046810(m)=n.at n=18A046813
- a(n) is the least integer that has exactly n anagrams that are primes.at n=18A046890
- Second term of strong prime 5-tuples: p(m)-p(m-1) > p(m+1)-p(m) > p(m+2)-p(m+1) > p(m+3)-p(m+2).at n=29A054809
- Prime numbers with odd digits in ascending order.at n=40A061244
- Prime(n) and prime(n+3) use the same digits.at n=11A069795
- Smallest prime that is obtained by placing digits on both sides of the n-th prime. Or smallest prime that encompasses the n-th prime.at n=36A075595
- Beginning with 2 the smallest prime greater than the previous term such that the difference of successive terms is a distinct square.at n=12A084710
- Consider the least k such that prime(k) > n*composite(k). Sequence gives prime(k).at n=6A093864
- Primes p such that little googol - p is prime.at n=28A108256
- a(n) = a(n-2)+a(n-3)+a(n-4)+a(n-5)+a(n-6)+2*a(n-7)+a(n-8).at n=24A109540
- Sophie Germain primes for which the reversal is also a Sophie Germain prime.at n=13A118573
- Largest squared prime factor of the odd Catalan number (A038003(n)) or 1, if it is squarefree.at n=24A119908
- Poincaré series [or Poincare series] P(T_{3,2}; x).at n=12A124615
- Largest prime <= 2^((n+1)/2).at n=25A133225
- Primes of the form 210k + 29.at n=31A140845
- Primes congruent to 35 mod 37.at n=40A142144
- Primes congruent to 17 mod 41.at n=35A142214