3973
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4140
- Proper Divisor Sum (Aliquot Sum)
- 167
- 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
- 3808
- Möbius Function
- 1
- Radical
- 3973
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 95
- Smith Number
- yes
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- MacMahon's solid partitions of n in which 2 is the smallest summand.at n=10A002043
- Numbers k such that k^4 can be written as a sum of four positive 4th powers.at n=21A003294
- "Pascal sweep" for k=9: draw a horizontal line through the 1 at C(k,0) in Pascal's triangle; rotate this line and record the sum of the numbers on it (excluding the initial 1).at n=46A009540
- Coordination sequence T2 for Zeolite Code RTE.at n=43A009891
- Coordination sequence T3 for Zeolite Code RTE.at n=43A009892
- a(0) = 1, a(n) = 11*n^2 + 2 for n>0.at n=19A010003
- a(n) = floor( n*(n-1)*(n-2)/20 ).at n=44A011902
- Number of partitions of n into parts 3k and 3k+2 with at least one part of each type.at n=48A035619
- Number of partitions of n into parts not of the form 25k, 25k+6 or 25k-6. Also number of partitions with at most 5 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=29A036005
- Numbers k such that k^4 can be written as a sum of four positive 4th powers with no common factor.at n=6A039664
- Numerators of continued fraction convergents to sqrt(301).at n=6A041566
- Numbers whose base-7 representation contains exactly three 4's.at n=32A043411
- Numbers whose base-5 representation contains exactly three 1's and two 3's.at n=26A045246
- Convolution of A000108 (Catalan numbers) with A045543.at n=3A045622
- A triangle related to A000108 (Catalan) and A000302 (powers of 4).at n=51A046527
- Number of nonisomorphic cyclic subgroups of the group S_n X S_n (where S_n is the symmetric group of degree n).at n=38A063183
- Composite n such that the sums of the composite numbers up to n, +/- 1, are twin primes.at n=30A065022
- a(n) = 4*(n+1)*n + 5.at n=31A078370
- a(n) = K_3(n) = Sum_{k>=0} A090285(3,k)*2^k*binomial(n,k). a(n) = (4*n^3+30*n^2+56*n+15)/3.at n=12A090294
- Smallest prime divisor of n-th partial concatenation is prime(n).at n=47A095216