3385
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4068
- Proper Divisor Sum (Aliquot Sum)
- 683
- 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
- 2704
- Möbius Function
- 1
- Radical
- 3385
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 180
- 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
- Centered triangular numbers: a(n) = 3*n*(n-1)/2 + 1.at n=47A005448
- Indices of primes where largest gap occurs.at n=13A005669
- Coordination sequence T1 for Zeolite Code ATS.at n=42A008038
- Coordination sequence T9 for Zeolite Code MFI.at n=37A008172
- Cycle class sequence c(n) (number of true cycles of length n in which a certain node is included) for zeolite NON = Nonasil-[ 4158 ] [Si88O176].4R starting with a T1 atom.at n=11A019209
- Pseudoprimes to base 26.at n=27A020154
- Numbers k such that the continued fraction for sqrt(k) has period 41.at n=4A020380
- a(n) = M(n) + m(n) for n >= 2, where M(n) = max{ a(i) + a(n-i): i = 1..n-1 }, m(n) = min{ a(i) + a(n-i): i = 1..n-1 }.at n=20A022905
- Number of partitions of n into parts not of form 4k+2, 24k, 24k+5 or 24k-5. Also number of partitions in which no odd part is repeated, with at most 2 parts of size less than or equal to 2 and where differences between parts at distance 5 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=41A036031
- Number of partitions of n such that cn(1,5) <= cn(0,5) = cn(2,5) < cn(3,5) = cn(4,5).at n=66A036852
- a(n)-th and (a(n)+1)-st primes are the first pair of primes that differ by exactly 2n; a(n) = -1 if no such pair of primes exists.at n=35A038664
- Smallest of three consecutive squarefree numbers k, k+1, k+2 of the form p*q where p and q are distinct primes.at n=36A039833
- Numbers n such that string 8,5 occurs in the base 10 representation of n but not of n-1.at n=36A044417
- Numbers n such that string 8,5 occurs in the base 10 representation of n but not of n+1.at n=36A044798
- Numbers having, in base 15, (sum of even run lengths)=(sum of odd run lengths).at n=9A044886
- Numbers whose base-5 representation contains exactly three 0's and two 2's.at n=8A045186
- a(n) = (F(n) + F(4*n))/2, where F=A000045 (the Fibonacci sequence).at n=5A049671
- Numbers n with prime signature(n) = prime signature(n+1) = prime signature(n+2).at n=44A052214
- Numbers k such that k, k+1 and k+2 are products of two primes.at n=38A056809
- Smallest integer >= 0 of the form x^3 - n^4.at n=15A070930