3365
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4044
- Proper Divisor Sum (Aliquot Sum)
- 679
- 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
- 2688
- Möbius Function
- 1
- Radical
- 3365
- 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
- 43
- 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
- A Fielder sequence: a(n) = a(n-1) + a(n-2) - a(n-7), n >= 8.at n=17A001636
- Endpoints in trees with n nodes.at n=11A003228
- a(n) = 3*n^2 + 3*n - 1.at n=33A004538
- Coordination sequence T5 for Zeolite Code MEL.at n=37A008154
- Coordination sequence T3 for Zeolite Code TON.at n=36A008243
- a(n) = floor( n*(n-1)*(n-2)/22 ).at n=43A011904
- Number of partitions of n into parts having a common factor.at n=54A018783
- Pseudoprimes to base 58.at n=22A020186
- Strong pseudoprimes to base 58.at n=6A020284
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = (1, p(1), p(2), ...).at n=51A024369
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = (primes).at n=50A024377
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/2n} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=31A024835
- Expansion of 1/(1-x)^2/(1-x^2)/(1-x^3)/(1-x^5)/(1-x^8).at n=30A034379
- Numbers whose square contains no loops in its digits (assumes 1, 2, 3, 5, 7 have no loops and 0, 4, 6, 8, 9 do).at n=36A034905
- Conjecturally, a power of 2 written in base 3 cannot have this many 0's.at n=26A036462
- Number of partitions of n such that cn(0,5) = cn(1,5) < cn(3,5) <= cn(2,5) = cn(4,5).at n=70A036872
- Numerators of continued fraction convergents to sqrt(374).at n=5A041708
- Numerators of continued fraction convergents to sqrt(421).at n=5A041800
- Denominators of continued fraction convergents to sqrt(842).at n=2A042625
- Numbers n such that string 6,5 occurs in the base 10 representation of n but not of n-1.at n=36A044397