13310
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 26352
- Proper Divisor Sum (Aliquot Sum)
- 13042
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4840
- Möbius Function
- 0
- Radical
- 110
- Omega Function (Ω)
- 5
- 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
- 169
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Smallest integer m such that the product of every 3 consecutive integers > m has a prime factor > prime(n).at n=8A003032
- Cubes written in base 8.at n=17A004638
- a(n) = floor(n/4)*floor((n+1)/4)*floor((n+2)/4)*floor((n+3)/4).at n=43A008233
- Triangle of coefficients in expansion of (1+11x)^n.at n=18A013618
- Triangle whose (i,j)-th entry is binomial(i,j)*11^(i-j)*1^j.at n=17A038315
- First differences of 11^n (A001020).at n=4A055276
- Numbers of the form 12*k + 2 with nonempty inverse totient set.at n=8A063668
- 11th binomial transform of (0,0,1,0,0,0,...).at n=5A081141
- a(n) = n^4 - n^3.at n=11A085537
- a(n) = n*(n + 1)^3.at n=10A085540
- Number of polynomials of the form x^n +- x^(n-1) +- x^(n-2) +- ... +- 1 irreducible over the integers.at n=13A087481
- Numbers whose set of base 11 digits is {0,A}, where A base 11 = 10 base 10.at n=8A097257
- Numbers of the form (10^i)*(11^j), with i, j >= 0.at n=13A108779
- Numbers with no 1's in base 3 & 4 expansions.at n=39A117496
- Numbers m such that m^k does not divide the denominator of the m-th generalized harmonic number H(m,k) nor the denominator of the m-th alternating generalized harmonic number H'(m,k), for k = 2.at n=40A128672
- Numbers m such that m^k does not divide the denominator of the m-th generalized harmonic number H(m,k) nor the denominator of the m-th alternating generalized harmonic number H'(m,k), for k = 4.at n=34A128674
- Numbers m such that m^k does not divide the denominator of the m-th generalized harmonic number H(m,k) nor the denominator of the m-th alternating generalized harmonic number H'(m,k), for k = 6.at n=42A128676
- a(n) = p^3*(p-1), where p = prime(n).at n=4A138403
- a(n) = ((n-th prime)^5-(n-th prime)^3)/12.at n=4A138437
- A triangular sequence of the expansion of: (1-Prime[n])^n: t(n,m)=(-1)^m*Prime[n]^(n - m)*Binomial[n, m]; with Prime[0]=1 defined to extend and lower the results.at n=17A141028