3873
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5168
- Proper Divisor Sum (Aliquot Sum)
- 1295
- 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
- 2580
- Möbius Function
- 1
- Radical
- 3873
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 51
- 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
- Coordination sequence T1 for Zeolite Code MEL.at n=40A008150
- Coordination sequence T2 for Zeolite Code THO.at n=44A008239
- Expansion of 1/((1-3*x)*(1-8*x)*(1-10*x)).at n=3A018069
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6,..., 1/2n} satisfy r < s, then r < k/m < s for some integer k.at n=49A024820
- a(n) = Sum_{k=1..n} k*[ (n/k)*[ n/k ] ].at n=32A024932
- a(n)/1000 gives sqrt(n) to 3 places after the decimal point.at n=14A027662
- Numbers k that divide the (left) concatenation of all numbers <= k written in base 5 (most significant digit on left).at n=9A029474
- a(n)^2 has last digit equal to the sum of the other digits.at n=13A030134
- 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 40.at n=26A031538
- Numbers k such that 243*2^k+1 is prime.at n=18A032498
- a(n) = T(5,n), array T given by A048471.at n=5A036546
- a(n) = 2^(n-1)*(3^n-1) + 1.at n=5A036551
- Number of dissectable polyhedra with n tetrahedral cells and symmetry of type I.at n=52A047753
- Duplicate of A047767.at n=13A047756
- Number of dissectable polyhedra with n tetrahedral cells and symmetry of type P.at n=25A047765
- a(n) = A047765(2n).at n=12A047767
- Becomes prime after exactly 6 iterations of f(x) = sum of prime factors of x.at n=37A047825
- Row sums of triangle A054446 (partial row sums triangle of Fibonacci convolution triangle).at n=8A054447
- Triangle of partial row sums of triangle A054446(n,m), n >= m >= 0.at n=36A054448
- a(n) = 2*n^2 + 1.at n=44A058331