11941
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 11942
- 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
- 11940
- Möbius Function
- -1
- Radical
- 11941
- 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
- 143
- 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
- 1432
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/5.at n=30A001135
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 64 ones.at n=22A031832
- Number of partitions of n with equal number of parts congruent to each of 0 and 4 (mod 5).at n=41A035555
- Primes with 10 as smallest positive primitive root.at n=33A061323
- Triangle of number of permutations by length of shortest ascending run.at n=47A064315
- Lesser of two consecutive primes such that n*p + q is a perfect square, p < q.at n=50A064545
- For n < 5, a(n) = n-th prime. For n >= 5, let m = n-th prime. If m is a k-digit prime then a(n) = smallest prime obtained by inserting at least one digit between every pair of digits of m. There are (k-1) places where digit insertion takes place and a(n) contains at least 2k-1 digits.at n=42A080437
- Prime partial sums of the odd-indexed primes.at n=8A096208
- Prime numbers which when written in base 7 have a composite digit-sum.at n=5A096790
- Primes of the form 47*k + 3.at n=33A100494
- a(n) = 1 + 2 * least i such that A103509(i)=n+1, 0 if no such i exists.at n=39A103510
- Triangle read by rows: T(n,k) is the number of binary sequences of length n containing k subsequences 001 (n,k>=0).at n=46A118424
- Number of binary sequences of length n containing exactly one subsequence 001.at n=15A118425
- a(n) is the largest prime < 9*a(n-1) for n > 1, with a(1) = 2.at n=4A126037
- Primes congruent to 27 mod 37.at n=38A142136
- Primes congruent to 10 mod 41.at n=31A142207
- Primes congruent to 30 mod 43.at n=35A142279
- Primes congruent to 34 mod 49.at n=37A142443
- Primes congruent to 7 mod 51.at n=41A142480
- Primes congruent to 16 mod 53.at n=30A142546