11789
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 11790
- 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
- 11788
- Möbius Function
- -1
- Radical
- 11789
- 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
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1413
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Expansion of 1/(1-x^5-x^6-x^7-x^8-x^9-x^10).at n=45A017841
- Numbers k such that the continued fraction for sqrt(k) has period 33.at n=31A020372
- Fibonacci sequence beginning 7, 15.at n=15A022389
- Denominators of continued fraction convergents to sqrt(431).at n=8A041821
- Fourth term of weak prime quintets: p(m-2)-p(m-3) < p(m-1)-p(m-2) < p(m)-p(m-1) < p(m+1)-p(m).at n=25A054826
- The first n digits of the juxtaposition of the base-3 numbers converted to decimal.at n=8A055144
- Primes with n-th successive differences a multiple of Fibonacci(n+1). a(n)-a(n-1) == 0 (mod F(n+1)), F(n+1) = A000045(n+1).at n=15A087580
- Diagonal of A088262.at n=35A088263
- 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=42A089577
- Number of partitions of 2*n into minimal numbers.at n=39A099385
- a(n) is the smallest prime p such that Sum_{primes q <= p} 1/q >= n/2.at n=4A103592
- Smallest prime p such that Sum_{primes q <= p} 1/q >= n/4.at n=9A103596
- Smallest prime p such that Sum_{primes q <= p} 1/q >= n/6.at n=14A103600
- Number of partitions of n such that the least part occurs at least twice.at n=34A117989
- Primes p = prime(i) of level (1,3), i.e., such that A118534(i) = prime(i-3).at n=21A118467
- Primes p that divide Fibonacci[(p-1)/7].at n=15A125253
- Primes p such that |100-p|, |1000-p|, |10000-p| and |100000-p| are also primes.at n=18A126021
- Primes p such that p^3 +- (p+1) are primes.at n=18A137472
- Primes of the form 210k + 29.at n=32A140845
- Primes congruent to 23 mod 37.at n=38A142132