3723
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
- 5328
- Proper Divisor Sum (Aliquot Sum)
- 1605
- 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
- 2304
- Möbius Function
- -1
- Radical
- 3723
- 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
- 131
- 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
- no
- Odd
- yes
Appears in sequences
- Expansion of 1/((1-x)^4*(1+x)).at n=33A002623
- Numbers k such that k^4 can be written as a sum of four positive 4th powers.at n=18A003294
- Number of permutations of [n] with four inversions.at n=13A005287
- Coordination sequence T3 for Zeolite Code DDR.at n=38A008073
- Coordination sequence for alpha-Mn, Position Mn2.at n=16A009951
- a(n) = n*(n+1)*(4*n+5)/6.at n=17A016061
- Convolution of odd numbers and primes.at n=15A023662
- Convolution of A014306 (starting 0,0,1,1,0,1,1,1,1,...) and primes.at n=46A023674
- a(n) = 1*(n+1-1) + 2*(n+1-2) + ... + k*(n+1-k), where k = floor((n+1)/2).at n=33A023856
- a(n) = 1*(n+3-1) + 2*(n+3-2) + .... + k*(n+3-k), where k=floor((n+1)/2).at n=32A023857
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = (natural numbers >= 2).at n=32A024853
- 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 61.at n=0A031559
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 61.at n=0A031739
- Number of partitions of n into parts 3k or 3k+1.at n=41A035360
- Numbers k such that k^4 can be written as a sum of four positive 4th powers with no common factor.at n=5A039664
- Numerators of continued fraction convergents to sqrt(149).at n=5A041272
- a(n)=(s(n)+1)/8, where s(n)=n-th base 8 palindrome that starts with 7.at n=35A043071
- a(n)=[A*a(n-1)+B*a(n-2)+C]/p^r, where p^r is the highest power of p dividing [A*a(n-1)+B*a(n-2)+C], A=1.0001, B=1.0001, C=1.5, p=2.at n=34A053522
- Numbers n such that n^2 contains exactly 8 different digits.at n=7A054036
- floor[2^n/Fibonacci(n)].at n=34A057861