11261
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
- 11262
- 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
- 11260
- Möbius Function
- -1
- Radical
- 11261
- 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
- 161
- 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
- 1362
- 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 65.at n=9A020404
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t = A002808 (composite numbers).at n=43A023863
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = (composite numbers).at n=42A024860
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 42.at n=0A031630
- The sequence e when b=[ 1,1,0,1,1,... ].at n=49A042955
- Primes of the form 2*n^2 + 11.at n=39A050265
- Primes p such that number of primes produced according to rules stipulated in Honaker's A048853 is 4.at n=34A050666
- Primes p whose period of reciprocal equals (p-1)/5.at n=23A056210
- Primes of the form sum 6d/(2 + mu(d)) for some k and all d dividing k.at n=25A069548
- Class 6+ primes.at n=9A081634
- Smallest positive integer m such that m+i^2=0 mod p_i (i-th prime) for 1<=i<=n.at n=5A083418
- Primes p such that the next prime after p can be obtained from p by adding the product of the digits of p.at n=7A089823
- Primes of the form 6*p - 1 such that p and 6*p - 5 are primes.at n=41A090609
- Smallest prime having exactly n representations as a^2+b^2+c^2 with c >= b >= a > 0.at n=43A094714
- Primes arising in A032682.at n=38A099677
- Primes with digital product = 12.at n=10A107697
- a(n) = A128020(n)/n.at n=17A128021
- Primes among variant of permutational numbers A134750.at n=34A134766
- Numbers k such that k and k^2 use only the digits 0, 1, 2, 6 and 8.at n=25A136829
- Primes congruent to 13 mod 37.at n=38A142122