11779
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 11780
- 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
- 11778
- Möbius Function
- -1
- Radical
- 11779
- 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
- 99
- 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
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1411
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes of the form m^2 + 3m + 9, where m can be positive or negative.at n=33A005471
- Expansion of e.g.f. log(sech(x) + arctanh(x)).at n=7A013209
- a(n) = [ 3rd elementary symmetric function of {sqrt(k)} ], k = 1,2,...,n.at n=13A025194
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 68 ones.at n=10A031836
- Values of A (the short leg) of a Pythagorean triangle with A and C (the hypotenuse) both prime and part of a twin prime.at n=27A051642
- Second term of weak prime quintets: p(m)-p(m-1) < p(m+1)-p(m) < p(m+2)-p(m+1) < p(m+3)-p(m+2).at n=25A054824
- Prime numbers with odd digits in ascending order.at n=42A061244
- Transpose of A085178.at n=53A085176
- Array A(x,y) giving the position of the y-th x in A080237 listed by rising antidiagonals.at n=46A085178
- Primes p such that the sum of the digits of p is not prime, but the sum of the squares of the digits of p is prime.at n=17A091362
- Expansion of g.f. x*(1-x+x^5+x^6-x^7+x^9)/(1-2*x+x^4+x^6-2*x^7+x^10).at n=16A097596
- Primes p such that p's set of distinct digits is {1,7,9}.at n=11A108384
- Primes such that the sum of the predecessor and successor primes is divisible by 31.at n=34A113155
- Numbers n such that p(7n) is prime, where p(n) is the number of partitions of n.at n=24A114167
- Primes of the form k(k+1)/2-2 (i.e., two less than triangular numbers).at n=44A124199
- Father primes of order 9.at n=40A136078
- Primes of the form 210k + 19.at n=31A140843
- Primes congruent to 13 mod 37.at n=40A142122
- Primes congruent to 12 mod 41.at n=35A142209
- Primes congruent to 40 mod 43.at n=29A142289