3934
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 6768
- Proper Divisor Sum (Aliquot Sum)
- 2834
- 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
- 1680
- Möbius Function
- -1
- Radical
- 3934
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 100
- Smith Number
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Number of (2n+1)-step self-avoiding walks on diamond lattice ending at point with x = 1.at n=4A001395
- Coordination sequence T2 for Zeolite Code LTL.at n=46A008139
- Coordination sequence T1 for Zeolite Code VSV.at n=40A009914
- a(n) = Sum_{k>=1} floor( 2*(1+sqrt(2))^(n-k) ).at n=8A020963
- a(1) = 5; a(n+1) = a(n)-th nonprime, where nonprimes begin at 4.at n=25A025010
- a(n) = least k such that 1+2+...+k >= E{1,2,...,n}, where E is the 3rd elementary symmetric function.at n=24A027917
- 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 62.at n=5A031560
- "DFK" (bracelet, size, unlabeled) transform of 2,1,1,1...at n=28A032215
- Coordination sequence T5 for Zeolite Code STF.at n=42A038440
- Numbers k such that 267*2^k-1 is prime.at n=31A050892
- Number of primitive (period n) bracelet structures using a maximum of three different colored beads.at n=12A056362
- Number of partitions of n with zero crank.at n=44A064410
- Centered 23-gonal numbers.at n=18A069174
- a(n) = a(n,m) = Sum_{k=0..n} binomial(m*k,k)*binomial(m*(n-k),n-k) for m=7.at n=3A079563
- Least positive k such that k * Z^n + 1 is prime, where Z = 10^100+267, the first prime greater than a googol.at n=30A108344
- Triangle T(n,k), 0 <= k <= n, read by rows given by: T(0,0)=1, T(n,k)=0 if k < 0 or if k > n, T(n,0) = 3*T(n-1,0) + T(n-1,1), T(n,k) = T(n-1,k-1) + T(n-1,k) + T(n-1,k+1) for k >= 1.at n=38A126954
- a(1)=1. a(n) = a(n-1) + (sum of the distinct primes that are <= n and don't divide a(n-1)).at n=43A137395
- Expansion of Product_{k>=1} (1 + x^k*A005185(k)).at n=21A147879
- sp(n)*pi(n) = A034387(n)*A000720(n) = (sum of primes <= n)*(number of primes <= n).at n=44A156780
- sp(n)*pi(n) = A034387(n)*A000720(n) = (sum of primes <= n)*(number of primes <= n).at n=43A156780