11393
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 11394
- 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
- 11392
- Möbius Function
- -1
- Radical
- 11393
- 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
- 130
- 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
- 1375
- 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 55.at n=15A020394
- Fourth term of strong 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=28A054811
- a(0)=0, a(1)=2, a(n) = smallest prime > a(n-1)+a(n-2).at n=18A055502
- Numbers k such that 10*7^k + 1 is prime.at n=17A057437
- Numbers k such that the smoothly undulating palindromic number (92*10^k - 29)/99 is a prime.at n=5A062228
- a(1) = 1, a(n) = a(n - 1) + pi(a(n - 1)) + 1.at n=41A065962
- 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=33A075595
- Proth primes: primes of the form k*2^m + 1 with odd k < 2^m, m >= 1.at n=38A080076
- Primes arising in A085042: a(n) = the n-th partial sum of A085042.at n=25A085043
- Beginning with 2, smallest primes such that a(k)-a(k-1) is a distinct power of 2.at n=10A087356
- Primes of the form 256n+129.at n=12A105130
- Primes p such that p's set of distinct digits is {1,3,9}.at n=21A108383
- Primes p such that p^3 +- (p+1) are primes.at n=17A137472
- Primes of the form 210k + 53.at n=28A140851
- Primes congruent to 34 mod 37.at n=33A142143
- Primes congruent to 36 mod 41.at n=33A142233
- Primes congruent to 41 mod 43.at n=27A142290
- Primes congruent to 19 mod 47.at n=29A142370
- Primes congruent to 25 mod 49.at n=28A142435
- Primes congruent to 51 mod 53.at n=24A142581