4707
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 6812
- Proper Divisor Sum (Aliquot Sum)
- 2105
- 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
- 3132
- Möbius Function
- 0
- Radical
- 1569
- Omega Function (Ω)
- 3
- 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
- 33
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- a(n) = Sum_{k=0..n} binomial(2*k,k).at n=7A006134
- Coordination sequence T3 for Zeolite Code HEU.at n=45A008118
- Coordination sequence T5 for Zeolite Code MTT.at n=42A008193
- Numbers k that divide s(k), where s(1)=1, s(j)=19*s(j-1)+j.at n=17A014869
- a(n) = n*(29*n + 1)/2.at n=18A022287
- Numbers k such that Fib(k) == -34 (mod k).at n=29A023169
- Coordination sequence T3 for Zeolite Code MWW.at n=45A024988
- 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 67.at n=21A031565
- Numbers whose set of base-6 digits is {3,4}.at n=36A032830
- Number of partitions satisfying cn(2,5) <= cn(0,5) + cn(3,5) and cn(2,5) <= cn(0,5) + cn(4,5) and cn(3,5) <= cn(0,5) + cn(1,5) and cn(3,5) <= cn(0,5) + cn(4,5).at n=34A039875
- Triangle of coefficients of characteristic polynomial of negative Pascal matrix with (i,j)-th entry -C(i+j-2,i-1).at n=37A045912
- Triangle of coefficients of characteristic polynomial of negative Pascal matrix with (i,j)-th entry -C(i+j-2,i-1).at n=43A045912
- Truncated triangular pyramid numbers: a(n) = Sum_{k=4..n} (k*(k+1)/2 - 9).at n=26A051937
- Numbers k such that average of prime(k) and prime(k+1) is a perfect square.at n=29A076692
- Number of rational knots of n crossings with signature 0 (chiral pairs counted twice).at n=15A078478
- The O(1) loop model on the square lattice is defined as follows: At every vertex the loop turns to the left or to the right with equal probability, unless the vertex has been visited before, in which case the loop leaves the vertex via the unused edge. Every vertex is visited twice. The probability that a face of the lattice on an n X infinity cylinder is surrounded by three loops is conjectured to be given by a(n)/A_{HT}(n)^2, where A_{HT}(n) is the number of n X n half turn symmetric alternating sign matrices.at n=2A092375
- a(n) = 2*n^2 - 2*n + 3.at n=48A097080
- a(n) = 3*(2*n^2 + 1).at n=28A097803
- Expansion of x/((1-x)*sqrt(1-4*x^2)).at n=16A100066
- Expansion of x/((1-x)*sqrt(1-4*x^2)).at n=15A100066