3714
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7440
- Proper Divisor Sum (Aliquot Sum)
- 3726
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 1236
- Möbius Function
- -1
- Radical
- 3714
- 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
- 38
- 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
- a(n) = 1000*log(n) rounded to the nearest integer.at n=40A004241
- Coordination sequence T1 for Zeolite Code GIS.at n=45A008266
- Numbers k such that the continued fraction for sqrt(k) has period 38.at n=42A020377
- 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 60.at n=10A031558
- Number of partitions satisfying cn(2,5) + cn(3,5) <= cn(1,5) + cn(4,5).at n=29A039895
- Catafusenes (see reference for precise definition).at n=6A045890
- a(n) = Sum_{i=0..n} T(i,n-i) where T is A049627.at n=32A049628
- Number of unlabeled simple connected bridged graphs on n nodes.at n=7A052446
- Numbers k such that k^2 + prime(k) and k^2 - prime(k) are both primes.at n=22A064483
- Interprimes which are of the form s*prime, s=6.at n=31A075281
- Distinct multiples of 3 such that the concatenation of a(n), a(n-1), ..., a(2), a(1), 1 is a prime and a(n) > a(n-1).at n=43A089757
- Draw a line through every pair of points with coordinates (x, 1) and (x', 2) with x, x' in 1..n, and then count the number of intersection points above the line y = 2.at n=14A092275
- Initial values for the iteration of the function f(x) = A063919(x) such that the iteration ends in a 5-cycle, i.e., in A097024.at n=29A097035
- Numbers n such that for some k and a_1,a_2,...,a_k the concatenation of the a_i is equal to n and their product is equal to pi(n).at n=27A097221
- Indices of primes in sequence defined by A(0) = 41, A(n) = 10*A(n-1) + 81 for n > 0.at n=12A101738
- Numbers n such that the concatenations (2*n),(2*n-1) and (2*n),(2*n+1) give twin primes.at n=48A102478
- Number of distinct values of i*j + j*k + k*i with 1 <= i < j <= k <= n.at n=42A102533
- Number of partitions of 2n prime to 3,5 with all odd parts occurring with even multiplicities. There is no restriction on the even parts.at n=27A103259
- Number of orbits of the 3-step recursion mod n.at n=55A106285
- Numbers n such that there exists at least one number j and pi(m) = d_1 d_2 ... d_j*d_(j+1) d_(j+2) ... d_k where d_1 d_2 ...d_k is the decimal expansion of n.at n=17A112012