3635
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
- 4368
- Proper Divisor Sum (Aliquot Sum)
- 733
- 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
- 2904
- Möbius Function
- 1
- Radical
- 3635
- 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
- 69
- 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
- Numerators of coefficients of Green function for cubic lattice.at n=4A003299
- Coordination sequence T2 for Zeolite Code LOV.at n=40A008135
- Coordination sequence T1 for Zeolite Code WEI.at n=43A009917
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers), t = (composite numbers).at n=16A024471
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 11.at n=32A031509
- Coordination sequence T1 for Zeolite Code SBT.at n=48A033612
- 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=40A034905
- Numbers that are divisible by 5 and are the difference between two (different positive) cubes in at least one way.at n=17A038853
- Numbers ending with '5' that are the difference of two positive cubes.at n=12A038860
- a(n) = (n+5)^3 - n^3.at n=13A038867
- Odd numbers with exactly 2 distinct palindromic prime factors.at n=45A046404
- Numbers k such that k | sigma_7(k) - phi(k)^7.at n=11A055701
- Number of primes in the interval [p(n), p(n)^2] minus p(n), where p(n) is the n-th prime.at n=42A066883
- Poincaré series [or Poincare series] (or Molien series) for a certain four-fold wreath product P_4.at n=37A091434
- Increasing gaps in A038593 (lower terms).at n=8A093342
- Duplicate of A093342.at n=8A093389
- Numbers m such that f(k) * 2^m - 1 is prime, where f(j) = A070826(j) and k is the number of decimal digits of 2^m.at n=27A095991
- Triangle, read by rows, where T(n,k) = T(n,k-1) + (k+1)*T(n-1,k) for n>k>0, T(n,0)=1 and T(n,n) = T(n,n-1) for n>=0.at n=24A102316
- a(n) = A104908(n) - 100*A104803(n).at n=17A104910
- Expansion of g.f. (1-x-x^3+x^4-2*x^2)/((1-2*x)*(x-1)^2*(x+1)^2).at n=15A106157