3774
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
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 8208
- Proper Divisor Sum (Aliquot Sum)
- 4434
- 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
- 1152
- Möbius Function
- 1
- Radical
- 3774
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- Expansion of 1 / ((1-x)^2*(1-x^2)*(1-x^3)*(1-x^4)).at n=33A002621
- Numbers that are the sum of 8 positive 6th powers.at n=37A003364
- McKay-Thompson series of class 4D for the Monster group.at n=6A007249
- Number of independent polynomial invariants of matrix of order n.at n=9A007718
- Coordination sequence T1 for Zeolite Code BIK.at n=38A008047
- Numbers n such that phi(n) * sigma(n) + 9 is a perfect square.at n=39A015728
- Number of partitions of n into distinct parts, none being 6.at n=54A015753
- a(n) is the concatenation of n and 2n.at n=36A019550
- T(2n+1,n+3), T given by A026769.at n=5A026889
- a(n) = Sum_{k=floor((n+2)/2)..n} T(n, k), T given by A026998.at n=10A027009
- a(n) = T(n,n) + T(n,n+1) + ... + T(n,2n), T given by A027960.at n=10A027973
- Expansion of Product_{m>=1} ((1+q^(2*m-1))/(1+q^(2*m)))^3.at n=37A029840
- Every run of digits of n in base 5 has length 2.at n=23A033003
- Number of permutations (p1,...,pn) such that 1 <= |pk - k| <= 2 for all k.at n=15A033305
- a(n) = floor(T_(n+1)/T_(n)) where T_n is n-th tangential or "Zag" number (see A000182).at n=47A034972
- Denominators of continued fraction convergents to sqrt(190).at n=13A041353
- Numbers congruent to 2,3,6,11 mod 12 missing from A042944 (conjectured to be finite).at n=23A042945
- Numbers whose base-4 representation contains exactly three 2's and three 3's.at n=12A045151
- First differences are A005563.at n=21A047732
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 6 skipped primes.at n=26A050773