3786
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7584
- Proper Divisor Sum (Aliquot Sum)
- 3798
- 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
- 1260
- Möbius Function
- -1
- Radical
- 3786
- 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
- Coordination sequence for NiAs(2), As position.at n=29A009945
- Coordination sequence for NiAs(2), Ni position.at n=29A009946
- Ordered sequence of distinct terms of the form floor(x^i * floor(x^j)), i,j >= 0, where x = sqrt(3).at n=39A022769
- Positive numbers k such that k and 2*k are anagrams in base 9 (written in base 9).at n=16A023079
- a(n) = T(n, n-3), T given by A026519. Also a(n) = number of integer strings s(0), ..., s(n), counted by T, such that s(n) = 3.at n=9A026523
- a(n) = T(n,n-3), T given by A026536. Also number of integer strings s(0), ..., s(n), counted by T, such that s(n) = 3.at n=9A026540
- a(n) = Sum_{k=0..2n-3} T(n,k) * T(n,k+3), with T given by A026519.at n=3A027265
- a(n) = Sum_{k=0..2n-3} T(n,k) * T(n,k+3), with T given by A026536.at n=4A027270
- a(n) = Sum_{k=0..m-3} T(n,k) * T(n,k+2), where m=n for n=0,1,2,3; m=2n for n >= 4; and T is given by A026082.at n=3A027318
- Number of distinct subgroups of alternating group A_n, counting conjugates as distinct.at n=7A029725
- Numbers k such that the string 6,6 occurs in the base 9 representation of k but not of k-1.at n=46A044311
- a(n) = 2*(n^2 - n + 1).at n=44A051890
- a(1) = 1; a(n+1) = sum of terms in continued fraction for the sum of the continued fractions, [a(1); a(2), a(3), ..., a(n)] and [0; a(1), a(2), a(3), ..., a(n)].at n=35A058082
- Least k such that gcd(prime(k+1)-1, prime(k)-1) = 2n.at n=12A067605
- Numbers k such that phi(k) = phi(sigma(k)-k).at n=45A067880
- Interprimes which are of the form s*prime, s=6.at n=32A075281
- Duplicate of A067605.at n=12A084308
- Sum of first n 3-almost primes.at n=40A086062
- Third column (m=4) of array A090452.at n=11A090453
- Numbers n such that 5*10^n + 4*R_n + 5 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=20A103016