3610
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 6858
- Proper Divisor Sum (Aliquot Sum)
- 3248
- 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
- 1368
- Möbius Function
- 0
- Radical
- 190
- Omega Function (Ω)
- 4
- 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
- 56
- 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
- yes
- Odd
- no
Appears in sequences
- Generalized ballot numbers (first differences of Motzkin numbers).at n=10A002026
- Pentagonal pyramidal numbers: a(n) = n^2*(n+1)/2.at n=19A002411
- Numbers k such that k! - 1 is prime.at n=19A002982
- Number of Hamiltonian paths in P_4 X P_n.at n=5A003695
- Coordination sequence T1 for Zeolite Code CAS.at n=36A008063
- Coordination sequence T1 for Zeolite Code -CHI.at n=38A009846
- Even pentagonal pyramidal numbers.at n=14A015224
- A Motzkin triangle: a(n,k), n >= 2, 2 <= k <= n, = number of complete, strictly subdiagonal staircase functions.at n=76A020474
- Position of numbers of form 3*n^2 in A025060 (numbers of form j*k + k*i + i*j, where 1 <=i < j < k).at n=31A025064
- a(n) = floor(Sum_{1<=i<j<=n} (sqrt(j)-sqrt(i))^2).at n=39A025196
- T(n,1) + T(n,2) + ... T(n,n), where T is the array in A026098.at n=17A026101
- Triangle T read by rows: differences of Motzkin triangle (A026300).at n=77A026105
- 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=64A026300
- a(n) = (1/2)*floor(n/2)*floor((n-1)/2)*floor((n-2)/2).at n=40A028724
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 12.at n=9A031690
- a(n) = floor(5*n^2/2).at n=38A032526
- a(n) = 10*n^2.at n=19A033583
- Compare partial sums of A033881 and A033884; this is the sequence of common terms.at n=5A033944
- Expansion of sum ( q^n / product( 1-q^k, k=1..5*n), n=0..inf ).at n=23A035297
- Number of partitions satisfying cn(0,5) + cn(1,5) <= cn(2,5) and cn(0,5) + cn(1,5) <= cn(3,5) and cn(0,5) + cn(4,5) <= cn(2,5) and cn(0,5) + cn(4,5) <= cn(3,5).at n=39A039882