11383
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
- 11384
- 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
- 11382
- Möbius Function
- -1
- Radical
- 11383
- 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
- 174
- 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
- 1374
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Largest prime == 7 (mod 8) with class number 2n+1.at n=13A002147
- Numbers k such that the continued fraction for sqrt(k) has period 100.at n=25A020439
- Partial sums of A000009 (partitions into distinct parts).at n=42A036469
- Primes base 10 that remain primes in five bases b, 2<=b<=10, expansions interpreted as decimal numbers.at n=36A052029
- Third term of strong prime 5-tuples: p(m-1)-p(m-2) > p(m)-p(m-1) > p(m+1)-p(m) > p(m+2)-p(m+1).at n=28A054810
- Number of collinear triples in a 3 X n rectangular grid.at n=29A057566
- a(n) = 6*n^2 + 6*n + 31.at n=43A060834
- Primes of the form 6*k^2 + 6*k + 31.at n=37A060844
- Smallest k such that n^8+k^8, n^4+k^4, n^2+k^2, n+k are simultaneously prime.at n=9A071564
- Numbers k such that 2*10^k + R_k + 8 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=7A102950
- a(n) = A120014(n)/n = coefficient of x^n, divided by n, in the n-th iteration of the g.f. of A120009 for n>=1.at n=6A120016
- Expansion of x*(1+3*x)*(1+6*x+16*x^2)/((1-x)*(1+2*x)*(1-3*x-2*x^2)).at n=6A120723
- Primes p such that q = 4p^2 + 1 and r = 4q^2 + 1 are also prime.at n=21A122424
- Primes occurring in A084704 exactly 4 times.at n=5A128655
- Intersection of A061068 and A064270.at n=27A128996
- Number of partitions of n into parts that are odd or == +- 2 (mod 10).at n=42A133153
- Primes of the form 2*p(k)+3*p(k+1)+4*p(k+2) for some k, where p(k)=A000040(k).at n=35A138665
- Primes of the form 210k + 43.at n=28A140849
- Primes congruent to 24 mod 37.at n=38A142133
- Primes congruent to 26 mod 41.at n=39A142223