3361
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 3362
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 3360
- Möbius Function
- -1
- Radical
- 3361
- 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
- 43
- 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
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 474
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p of the form 3k+1 such that sum_{x=1..p} cos(2*Pi*x^3/p) < -sqrt(p).at n=45A000923
- Sextan primes: p = (x^6 + y^6)/(x^2 + y^2).at n=13A002647
- Number of partitions of n with at least 1 odd and 1 even part.at n=28A006477
- 7th-order maximal independent sets in path graph.at n=53A007381
- Primes p == 1 (mod 8), p = a^2 + 64*b^2 such that y^2 = x^3 + p*x has rank 2.at n=43A007766
- Coordination sequence T6 for Zeolite Code MTW.at n=38A008201
- Coordination sequence T3 for Zeolite Code VET.at n=35A009904
- Expansion of 1/(1-x^5-x^6-x^7-x^8-x^9-x^10-x^11-x^12).at n=38A017843
- Numbers k such that the continued fraction for sqrt(k) has period 95.at n=0A020434
- Let q_k = p*(p+2) be product of k-th pair of twin primes; sequence gives values of p+2 such that (q_k)^2 > q_{k-i}*q_{k+i} for all 1 <= i <= k-1.at n=30A021007
- Smallest prime having least positive primitive root n, or 0 if no such prime exists.at n=21A023048
- Primes that remain prime through 3 iterations of function f(x) = 9x + 10.at n=18A023299
- Primes that remain prime through 4 iterations of function f(x) = 9x + 10.at n=6A023327
- Greatest prime divisor of prime(n)*prime(n-1) + 1.at n=47A023525
- Numbers with exactly 7 1's in their ternary expansion.at n=12A023698
- a(n) = least m such that if r and s in {1/1, 1/4, 1/7, ..., 1/(3n-2)} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=26A024836
- Coordination sequence T8 for Zeolite Code MWW.at n=39A024993
- Numbers whose least quadratic nonresidue (A020649) is 11.at n=20A025024
- a(n) = sum of the numbers between the two n's in A026346.at n=37A026349
- a(n) = Sum{T(i,j)}, 0<=j<=i, 0<=i<=2n, T given by A026568.at n=8A026583