3808
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 9072
- Proper Divisor Sum (Aliquot Sum)
- 5264
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1536
- Möbius Function
- 0
- Radical
- 238
- Omega Function (Ω)
- 7
- 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
- 38
- 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
- a(n) = 8*binomial(2*n+1,n-3)/(n+5).at n=5A003518
- a(n) = ceiling(1000*log_2(n)).at n=13A004267
- a(n) is the number of Dyck paths of semilength n+6 having its first peak at height n+1.at n=7A005557
- Exponential self-convolution of Pell numbers (divided by 2).at n=7A006668
- Coordination sequence T1 for Zeolite Code JBW.at n=41A008121
- Coordination sequence T2 for Scapolite.at n=39A008263
- a(n) = floor(n*(n-1)*(n-2)*(n-3)/15).at n=17A011925
- Expansion of 1/((1-x)(1-8x)(1-11x)).at n=3A016259
- Number of solutions to c(1)*prime(2)+...+c(n)*prime(n+1) = 1, where c(i) = +-1 for i > 1, c(1) = 1.at n=20A022898
- a(n) = Sum_{i=0..n} Sum_{j=0..i} T(i,j), T given by A026584.at n=9A026598
- Every run of digits of n in base 15 has length 2.at n=26A033013
- Numbers whose base-15 expansion has no run of digits with length < 2.at n=41A033028
- Number of 5-ary rooted trees with n nodes and height at most 7.at n=12A036618
- First differences of A037260.at n=22A037261
- Triangle formed from odd-numbered columns of triangle of expansions of powers of x in terms of Chebyshev polynomials U_n(x). Sometimes called Catalan's triangle.at n=39A039598
- Positive integers with more base-15 runs of even length than odd.at n=27A044841
- T(n,k) = M(2n-1,n-1,k-1), 0 <= k <= n, n >= 0, where M(p,q,r) is the number of upright paths from (0,0) to (p,p-q) that meet the line y = x+r and do not rise above it.at n=49A050144
- T(n,k)=M(2n+1,n-1,k-1), 0<=k<=n, n >= 0, array M as in A050144.at n=39A050153
- T(n,k)=M(2n+3,n+3,k+3), 0<=k<=n, n >= 0, array M as in A050144.at n=30A050156
- Triangle T(n,k) = M(2n,k,-1), with 0 <= k <= n, n >= 0, and array M is defined in A050144.at n=41A050166