6705
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
- 12
- Divisor Sum
- 11700
- Proper Divisor Sum (Aliquot Sum)
- 4995
- 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
- 3552
- Möbius Function
- 0
- Radical
- 2235
- Omega Function (Ω)
- 4
- 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
- 44
- 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
- Pseudoprimes to base 44.at n=39A020172
- Number of words of length 4 in the n(n-1)/2 transpositions of S[ n ] equivalent to the identity.at n=9A029699
- Numerators of continued fraction convergents to sqrt(223).at n=5A041416
- Average of terms in n-th row of A077316.at n=40A077319
- G.f. = continued fraction: A(x)=1/(1-x-x^2-x^3/(1-x^4-x^5-x^6/(1-x^7-x^8-x^9/(...)))).at n=15A088353
- Expansion of g.f. (1-4*x^2+2*x^3)/((1-x)*(1-2*x-2*x^2+2*x^3)).at n=10A106666
- Irregular triangle read by rows T(n,k) (n>=1, 0<=k<=n(n-1)/2) giving the total number of connected components in all subgraphs (V,E') with |E'|=k of the complete labeled graph K_n=(V,E).at n=33A125205
- Triangular array T(n,k) (n>=1, 0<=k<=n(n-1)/2) giving the total number of connected components in all subgraphs obtained from the complete labeled graph K_n by removing k edges.at n=32A125206
- a(n) = n*(3*n+14).at n=45A140679
- a(n) = (2*n^3 + 5*n^2 + 7*n)/2.at n=17A162264
- Partial sums of A160120.at n=30A162778
- a(n) = 3*n*(5*n-1)/2.at n=29A167469
- Coefficient array of orthogonal polynomials P(n,x)=x*P(n-1,x)-(2n-3)*P(n-2,x), P(0,x)=1,P(1,x)=x.at n=46A178103
- Number of distinct values of Sum_{i=0..n} x(i)*binomial(n,i), where the x(i) have values in 0..4.at n=11A205539
- Triangle T(n,k) represents the coefficients of (x^9*d/dx)^n, where n=1,2,3,...;generalization of Stirling numbers of second kind A008277, Lah-numbers A008297.at n=18A223511
- Numbers of undirected cycles in the complete tripartite graph K_{n,n,n}.at n=2A234616
- G.f. A(x) satisfies 0 = A(0) and 0 = f(x, A(x)) where f(u, v) = (u - v) * (1 + u*v) - u*v * (1 - u*v).at n=15A245735
- Number of length 5 1..(n+2) arrays with no leading or trailing partial sum equal to a prime and no consecutive values equal.at n=9A254222
- One-half of the x member of the positive proper fundamental solution (x = x2(n), y = y2(n)) of the second class for the Pell equation x^2 - D(n)*y^2 = +8 for even D(n) = A264354(n).at n=24A264438
- Numbers k such that 333*2^k+1 is prime.at n=27A322959