3311
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 4224
- Proper Divisor Sum (Aliquot Sum)
- 913
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2520
- Möbius Function
- -1
- Radical
- 3311
- 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
- 167
- 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
- Square pyramidal numbers: a(n) = 0^2 + 1^2 + 2^2 + ... + n^2 = n*(n+1)*(2*n+1)/6.at n=21A000330
- Smallest k such that the product of q/(q-1) over the primes from prime(n) to prime(n+k-1) is greater than 2.at n=38A001276
- The coding-theoretic function A(n,4,4).at n=40A001843
- Denominators of expansion of sinh x / sin x.at n=21A006656
- a(n) = binomial(n+3, 3)/4 for odd n, n*(n+2)*(n+4)/24 for even n.at n=41A006918
- Molien series of 4-dimensional representation of cyclic group of order 4 over GF(2) (not Cohen-Macaulay).at n=41A008610
- a(n) = floor(n*(n-1)*(n-2)/24).at n=44A011842
- Triangle of Gaussian (or q-binomial) coefficients for q = -2.at n=31A015109
- Triangle of Gaussian (or q-binomial) coefficients for q = -2.at n=32A015109
- Odd square pyramidal numbers.at n=10A015221
- Gaussian binomial coefficient [ n,3 ] for q = -2.at n=4A015266
- Gaussian binomial coefficient [ n,4 ] for q = -2.at n=3A015287
- Expansion of 1/(1 - x^10 - x^11 - ...).at n=60A017904
- Coordination sequence T2 for Zeolite Code SAO.at n=45A019572
- Coordination sequence T3 for Zeolite Code SAO.at n=45A019573
- Pseudoprimes to base 85.at n=33A020213
- Expansion of g.f. 1/((1 - x)*(1 - 2*x)*(1 - 4*x)*(1 - 12*x)).at n=3A021104
- a(n) = s(1)*s(n) + s(2)*s(n-1) + ... + s(k)*s(n+1-k), where k = floor((n+1)/2), s = (odd natural numbers).at n=20A024598
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A014306, t = (primes).at n=49A024696
- Index of 10^n within the sequence of the numbers of the form 2^i*10^j.at n=44A025740