3293
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3420
- Proper Divisor Sum (Aliquot Sum)
- 127
- 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
- 3168
- Möbius Function
- 1
- Radical
- 3293
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 136
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Generalized sum of divisors function.at n=41A002130
- a(n) = min { p +- q : p +- q > 1 and p*q = Product_{k=1..n-1} a(k) }.at n=9A003681
- Coordination sequence T1 for Zeolite Code CHA.at n=44A008066
- Coordination sequence T1 for Zeolite Code FAU.at n=48A008105
- a(n) = floor(binomial(n,3)/3).at n=40A011849
- Smallest odd k>n such that k | n^k + n, or 0 if n=2^m.at n=37A015908
- Plaindromes: numbers whose digits in base 3 are in nondecreasing order.at n=39A023745
- Numbers k such that 63*2^k+1 is prime.at n=36A032381
- Number of partitions of n into parts not of form 4k+2, 16k, 16k+7 or 16k-7.at n=43A036023
- Sum of the lengths of the cycle types of the permutation created by duality and reversal on the partitions of n.at n=27A036050
- Numerators of continued fraction convergents to sqrt(595).at n=6A042140
- Numbers n such that string 9,3 occurs in the base 10 representation of n but not of n-1.at n=35A044425
- Numbers k such that the digit string 9,3 occurs in the base-10 representation of k but not of k+1.at n=35A044806
- Numbers whose base-5 representation contains exactly three 1's and two 3's.at n=10A045246
- a(1) = 7; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=36A046257
- Smallest value of x such that M(x) = n, where M() is Mertens's function A002321.at n=21A051400
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 3.at n=8A051968
- Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives j values.at n=26A053720
- (1/2)*(n^2+n+2)*(n^2+3*n+1).at n=8A058310
- Consider Pythagorean triples which satisfy X^2+(X+7)^2=Z^2; sequence gives increasing values of Z.at n=7A060569