3915
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 7200
- Proper Divisor Sum (Aliquot Sum)
- 3285
- 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
- 2016
- Möbius Function
- 0
- Radical
- 435
- Omega Function (Ω)
- 5
- 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
- 100
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Numbers k such that (k / product of digits of k) is 1 or a prime.at n=26A001103
- Number of series-reduced rooted trees with n nodes.at n=17A001679
- G.f.: (1 + x^4 + x^7 + 2*x^8 + x^9 + x^12 + x^16)/Product_{i=1..8} (1 - x^i).at n=27A003405
- Number of nonequivalent dissections of an n-gon into 3 polygons by nonintersecting diagonals rooted at a cell up to rotation and reflection.at n=28A003452
- Column of Motzkin triangle.at n=8A005322
- Coordination sequence T2 for Zeolite Code AFS.at n=48A008024
- Coordination sequence T2 for Zeolite Code BPH.at n=48A008056
- Coordination sequence T1 for Zeolite Code MEP.at n=37A008157
- Coordination sequence T5 for Zeolite Code NES.at n=40A008209
- a(n) = n*(2*n-3).at n=45A014107
- Number of 5-tuples of different integers from [ 2,n ] with no common factors among pairs.at n=28A015699
- Coordination sequence T1 for Zeolite Code OSI.at n=41A016430
- Motzkin triangle, T, read by rows; T(0,0) = T(1,0) = T(1,1) = 1; for n >= 2, T(n,0) = 1, T(n,k) = T(n-1,k-2) + T(n-1,k-1) + T(n-1,k) for k = 1,2,...,n-1 and T(n,n) = T(n-1,n-2) + T(n-1,n-1).at n=63A026300
- Number of partitions of n in which the least part is odd.at n=28A026804
- Greatest number in row of n array T given by A026300.at n=10A026938
- Coordination sequence T1 for Zeolite Code SAT.at n=45A027373
- 9 times the triangular numbers A000217.at n=29A027468
- a(n) = n^3 + (n+1)^3 + (n+2)^3 + (n+3)^3 + (n+4)^3.at n=7A027604
- Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 16 (most significant digit on right).at n=25A029509
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 11 ones.at n=10A031779