3395
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 4704
- Proper Divisor Sum (Aliquot Sum)
- 1309
- 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
- 2304
- Möbius Function
- -1
- Radical
- 3395
- 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
- 35
- 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
- Number of partitions of n into parts of sizes {a( )} is a(n).at n=43A007209
- Coordination sequence T2 for Zeolite Code ATS.at n=42A008039
- Coordination sequence T1 for Zeolite Code -WEN.at n=42A009862
- Coordination sequence T3 for Zeolite Code VNI.at n=36A009909
- Coordination sequence T1 for Zeolite Code VSV.at n=37A009914
- Nine iterations of Reverse and Add are needed to reach a palindrome.at n=15A015990
- Base 6 expansion uses each positive digit just once.at n=32A023744
- a(n) = A024741(n+3)/6.at n=9A024742
- a(n) = s(n+3)/3, where s is A024961.at n=8A024962
- For n odd, >1, not divisible by 3, we can write 3/n = 1/a + 1/b + 1/c with a>b>c>0, a,b,c distinct and odd; sequence gives smallest a.at n=31A027442
- For n != 1 mod 3, we can write 3/(2n+1) = 1/a + 1/b + 1/c with a>b>c>0, a,b,c distinct and odd; sequence gives smallest such a, or 1 if n = 1 mod 3.at n=47A027443
- Triangle of coefficients arising in calculation of A002872 and A002874 (sorting numbers).at n=26A036073
- Numbers n such that lcm(sigma(n),phi(n)) is a perfect square.at n=26A043293
- Numbers whose base-15 representation has exactly 4 runs.at n=4A043671
- Numbers k such that the string 8,2 occurs in the base 9 representation of k but not of k-1.at n=45A044325
- Numbers n such that string 9,5 occurs in the base 10 representation of n but not of n-1.at n=36A044427
- Numbers k such that string 9,5 occurs in the base 10 representation of k but not of k+1.at n=36A044808
- a(n) = a(n-1)+a(m), where m=2n-2-2^(p+1) and 2^p<n-1<=2^(p+1), for n >= 4.at n=25A050071
- A list of equal temperaments (equal divisions of the octave) whose nearest scale steps are closer and closer approximations to six complementary pairs of ratios which generate simple musical tones (scale steps): 8/7 and 7/4, 6/5 and 5/3, 16/13 and 13/8, 5/4 and 8/5, 4/3 and 3/2 and 11/8 and 16/11.at n=39A060233
- G.f.: (1 + Sum_{ i >= 0 } 2^i*x^(2^(i+1)-1)) / (1-x)^3.at n=28A063916