4053
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 6208
- Proper Divisor Sum (Aliquot Sum)
- 2155
- 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
- 4053
- 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
- 113
- 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
- Number of points of norm <= n^2 in square lattice.at n=36A000328
- Numbers k such that k! - (k-1)! + (k-2)! - (k-3)! + ... - (-1)^k*1! is prime.at n=18A001272
- Spiral sieve using Fibonacci numbers.at n=17A005621
- Number of conjugacy classes in GL(n,2).at n=12A006951
- a(n) = floor(n*(n-1)*(n-2)/24).at n=47A011842
- Number of partitions of n into distinct parts, none being 8.at n=54A015755
- Number of partitions of 1/n into 4 reciprocals of positive integers.at n=8A020327
- a(1) = 3; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=30A033681
- Number of partitions of n with equal number of parts congruent to each of 0 and 2 (mod 4).at n=38A035541
- Number of partitions of n with equal number of parts congruent to each of 2, 3 and 4 (mod 5).at n=48A035581
- Expansion of (1/(1-x^2))*Product_{m>=0} 1/(1-x^(2m+1)).at n=39A038348
- Numerators of continued fraction convergents to sqrt(243).at n=5A041454
- Numerators of continued fraction convergents to sqrt(972).at n=5A042880
- Numbers whose base-4 representation contains exactly three 1's and three 3's.at n=19A045127
- Numbers n such that 39*2^n-1 is a prime.at n=11A050545
- Number of irreducible representations of the symmetric group S_n that have even degree.at n=28A060368
- Numbers k such that the period of the continued fraction for sqrt(3)*k is 2.at n=38A064933
- Least nontrivial multiple of the n-th prime beginning with 4.at n=43A078288
- Let f(0)=1, f(1)=t, f(n+1) = (f(n)^2+t^n)/f(n-1). f(t) is a polynomial with integer coefficients. Then a(n) = f(n) when t=3.at n=6A081704
- a(n) = 2*n^2 + 3.at n=45A093328