3782
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5952
- Proper Divisor Sum (Aliquot Sum)
- 2170
- 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
- 1800
- Möbius Function
- -1
- Radical
- 3782
- 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
- yes
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) = (3*n+1)*(3*n+2).at n=20A001504
- a(n) = 2*n*(2*n-1).at n=31A002939
- a(n) = ceiling(n*phi^11), where phi is the golden ratio, A001622.at n=19A004966
- Coordination sequence T1 for Zeolite Code MER.at n=45A008160
- Coordination sequence T1 for Milarite.at n=38A008256
- Coordination sequence T3 for Zeolite Code RSN.at n=40A009887
- Powers of fourth root of 20 rounded down.at n=11A018102
- Expansion of g.f. 1/((1-x)*(1-6*x)*(1-7*x)*(1-8*x)).at n=3A023949
- a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0 = s(n), |s(i) - s(i-1)| = 1 for i = 1,2; |s(i) - s(i-1)| <= 1 for i >= 3. Also a(n) = T(n,n), where T is the array defined in A024996.at n=7A024997
- a(n) = self-convolution of row n of array T given by A025177.at n=5A027257
- Numbers whose set of base-12 digits is {2,3}.at n=16A032812
- Product of a prime and the following number.at n=17A036690
- a(n)=(s(n)+4)/9, where s(n)=n-th base 9 palindrome that starts with 5.at n=35A043076
- a(n) = Sum_{i=0..floor((n+1)/2)} T(2i+1,n-2i-1) where T is A049615.at n=46A049619
- Numbers k such that floor(Pi*k) is a square.at n=39A061812
- Smallest m such that A064672(m) = n.at n=22A064689
- Squarefree numbers k with largest prime factor = floor(sqrt(k)).at n=10A071311
- Numbers k such that the largest prime factor of k is equal to floor(sqrt(k)).at n=44A071835
- Sum of all cubefree numbers with the same squarefree kernel as the n-th squarefree number.at n=37A073245
- a(n) = 4*((n-1)! + 1) + n (mod n*(n + 2)).at n=60A073830