11315
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
- 8
- Divisor Sum
- 14208
- Proper Divisor Sum (Aliquot Sum)
- 2893
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8640
- Möbius Function
- -1
- Radical
- 11315
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 112
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = position of n^3 + (n+1)^3 + (n+2)^3 in A024975.at n=32A024980
- Number of connected functions on n points with a loop of length 5.at n=9A029868
- Position at which increasing values of the Improperly Reduced Fibonacci Sequence (A058981) occur.at n=21A058983
- Sum of squares of digits of n is equal to the largest prime factor of n reversed, where the largest prime factor is not a palindrome.at n=16A074303
- Numbers n such that n is divisible by (3*s(n)*s(n)+2), where s(n) = sum of digits of n.at n=43A134556
- A triangle sequence of polynomial coefficients: p(x,n)=(-1)^(n + 1)*(x - 1)^(3*n + 1)*Sum[(Binomial[m, n]* Binomial[m + 1, n + 1]/(m - n + 1))*(m + 1)^ n*x^m, {m, 0, Infinity}]/(x^n); t(n,m)=coefficients(p(x,n)).at n=14A155756
- Number of length 3 0..n arrays with each partial sum starting from the beginning no more than two standard deviations from its mean.at n=21A244834
- Numbers m such that each of p=6*m+1, q=6*p+1, r=6*q+1 and s=6*r+1 is prime.at n=15A263311
- Number of fully chiral integer partitions of n.at n=35A330228
- Sphenic numbers that are also the sum of three consecutive primes.at n=41A335969
- Dirichlet convolution of the arithmetic derivative with the primorial base exp-function.at n=57A359425
- Number of partitions of n with rank 4 (the rank of a partition is the largest part minus the number of parts).at n=51A363213
- Triangle read by rows: T(n,k) is the number of distinct tuples E each corresponding to some k-ary word W = (w_1, ..., w_n), where E is a tuple (e_1, ..., e_{n-1}) with e_i being the number of pairs of equal letters (w_j,w_k) in W such that j + i = k.at n=48A381349
- Numbers that are the concatenation of three (not necessarily distinct) primes whose sum is prime, and are also the product of three (not necessarily distinct) primes whose sum is prime.at n=24A385452