11243
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 11244
- 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
- 11242
- Möbius Function
- -1
- Radical
- 11243
- 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
- 68
- 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
- 1359
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Discriminants of quintic fields with 2 complex conjugates (negated).at n=13A023684
- Numerators of continued fraction convergents to sqrt(211).at n=7A041392
- Numerators of continued fraction convergents to sqrt(844).at n=5A042628
- Numbers whose base-4 representation contains exactly four 2's and three 3's.at n=7A045156
- Discriminants of imaginary quadratic fields with class number 25 (negated).at n=20A056987
- Primes which, although they have correct parity, are not in the prime number maze.at n=22A065123
- a(0) = 2; a(n) for n > 0 is the smallest prime greater than a(n-1) that differs from a(n-1) by a square.at n=37A073609
- Primes of the form k^2 + 7.at n=27A079138
- Primes whose decimal representation is a valid number in base 5 and interpreted as such is again a prime.at n=22A090708
- Value of C in y = x^2+7x+C such that y is prime for all x = 0 to 4.at n=18A097436
- A variation on Flavius's sieve (A000960): Start with the primes; at the k-th sieving step, remove every (k+1)-st term of the sequence remaining after the (k-1)-st sieving step; iterate.at n=41A099207
- Primes with maximal digit = 4.at n=39A106098
- Values of x in x^2 - 49 = 2*y^2.at n=13A106525
- Sum of the lengths of the first descents in all hill-free Dyck paths of semilength n (a hill in a Dyck path is a peak at level 1).at n=10A118974
- Primes for which the weight as defined in A117078 is 15 and the gap as defined in A001223 is 8.at n=20A119595
- Primes p such that p^2 is an interprime = average of two successive primes.at n=36A123993
- Primes congruent to 32 mod 37.at n=40A142141
- Primes congruent to 9 mod 41.at n=39A142206
- Primes congruent to 20 mod 43.at n=34A142269
- Primes congruent to 10 mod 47.at n=31A142361