3615
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5808
- Proper Divisor Sum (Aliquot Sum)
- 2193
- 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
- 1920
- Möbius Function
- -1
- Radical
- 3615
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 69
- Smith Number
- yes
- 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
- Divisors of 2^24 - 1.at n=46A003532
- a(n) = floor( n*(n-1)*(n-2)/14 ).at n=38A011896
- Numbers k that divide s(k), where s(1)=1, s(j)=15*s(j-1)+j.at n=27A014865
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite EUO = EU-1 Nan[AlnSi112-nO224] starting with a T4 atom.at n=11A019123
- a(n) = n^3 + n^2 + n.at n=15A027444
- Least term in period of continued fraction for sqrt(n) is 8.at n=15A031432
- Numbers whose set of base 15 digits is {0,1}.at n=14A033051
- Coordination sequence T3 for Zeolite Code SBT.at n=48A033614
- Digit sum of 'odd' number equals digit sum of 'sum' and 'juxtaposition' of its prime factors (counted with multiplicity).at n=25A036927
- a(n)=Sum{T(n,j): j=1,2,...,n}, array T given by A048201.at n=16A048209
- Number of rooted trees with n nodes with every leaf at height 9.at n=16A048814
- Harshad numbers which terminate in their digital sum.at n=23A070938
- Interprimes which are of the form s*prime, s=15.at n=20A075290
- Let u(1)=1, u(n)=2^u(n-1) (mod n), sequence gives values of n such that u(n)=1.at n=37A076825
- Starting with a(0) = 1, smallest squarefree number k such that, for all a(m), m < n, k + a(m) is not squarefree.at n=9A077225
- Starting with a(0) = 1, smallest number k > a(n-1) such that, for all a(m) with m < n, k + a(m) is not squarefree.at n=8A080793
- Starting with a(0)=5, a(n) = smallest squarefree number k such that, for all a(m) with m<n, k+a(m) is not squarefree.at n=12A080797
- Beginning with 3, a(i)*a(j) + 2 is prime for all i, j, i<>j.at n=6A083518
- a(n) = smallest k where (10^k+1)=0 mod prime(n)^2, or 0 if no such k exists.at n=52A086981
- Numbers belonging to both A077225 and A080797 (in the order in which they appear in A077225).at n=5A090627