11519
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
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 11520
- 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
- 11518
- Möbius Function
- -1
- Radical
- 11519
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 112
- 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
- 1389
- 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 100.at n=26A020439
- Numbers k such that k*2^m-1 are composites for all exponents m in the range 0<=m<=k.at n=30A061154
- a(n) is smallest prime > 10*a(n-1), a(1) = 11.at n=3A065538
- First of triples of consecutive happy numbers, i.e., the first of three consecutive integers each of which is a happy number (A007770).at n=14A072494
- Smallest initial value k that reaches 1 in n steps when iterating the map m -> rad(m)-1, where rad(m) is the squarefree kernel of m (A007947).at n=20A075426
- 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=35A075595
- a(1) = 5 and then the smallest prime that is obtained by placing digits on both sides of the previous term. Or smallest prime that encompasses a(n-1).at n=2A075598
- Smallest prime factor of prime(n)! / prime(n)# + 1.at n=34A103891
- Primes in A112714.at n=39A112715
- Primes for which the weight as defined in A117078 is 9 and the gap as defined in A001223 is 8.at n=36A118922
- Numbers n such that ((1+I)^n+1)/(2+I) is a Gaussian prime.at n=23A124112
- Primes p such that (2^p + 2^((p+1)/2) + 1)/5 is prime.at n=6A124165
- Primes of the form 64n+63.at n=38A127579
- Toothpick primes: primes in the toothpick sequence A139250.at n=43A139253
- Primes congruent to 18 mod 31.at n=40A142022
- Primes congruent to 12 mod 37.at n=37A142121
- Primes congruent to 39 mod 41.at n=35A142236
- Primes congruent to 38 mod 43.at n=29A142287
- Primes congruent to 4 mod 47.at n=25A142356
- Primes congruent to 4 mod 49.at n=30A142417