6579
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 10296
- Proper Divisor Sum (Aliquot Sum)
- 3717
- 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
- 4032
- Möbius Function
- 0
- Radical
- 2193
- 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
- 137
- 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(1) = a(2) = 1, a(3) = 4; thereafter a(n) = a(n-1) + a(n-3).at n=22A001609
- a(n) = C(n,1) + C(n,2) + C(n,3), or n*(n^2 + 5)/6.at n=34A004006
- a(n) = (n^3 + 2*n)/3.at n=27A006527
- Least term in period of continued fraction for sqrt(n) is 9.at n=8A031433
- Number of partitions satisfying cn(2,5) <= cn(0,5) and cn(3,5) <= cn(0,5).at n=38A039863
- Numbers having three 0's in base 9.at n=17A043455
- a(n) = (2*n+1)*(4*n^2+4*n+3)/3.at n=13A057813
- Numbers k such that sopf(k) = sopfr(k+1), where sopf(k) = A008472(k) and sopfr(k) = A001414(k).at n=17A064678
- Numbers k such that phi(k) = sigma(k+1) - sigma(k-1).at n=13A066155
- Numbers k such that phi(k) divides (sigma(k+1) + sigma(k-1)).at n=34A067244
- Let a = RootOf( x^2+x+1 ) and b = 1+a. Number of degree-n irreducible polynomials over GF(4) with trace 1 and subtrace a.at n=9A074035
- Number of 4-ary Lyndon words of length n over Z_4 with trace 0 and subtrace 3.at n=9A074405
- Number of 4-ary Lyndon words of length n over Z_4 with trace 2 and subtrace 0.at n=9A074410
- Number of 4-ary Lyndon words of length n over GF(4) with trace 1 and subtrace 0.at n=9A074448
- Number of 4-ary Lyndon words of length n over GF(4) with trace 1 and subtrace 1.at n=9A074449
- Number of n X n {-1,0,1} matrices modulo cyclic permutations of the rows.at n=3A086683
- Expansion of (chi(-q^3)^8 + 16*q^2/ chi(-q^3)^8)^(1/8) in powers of q where chi() is a Ramanujan theta function.at n=9A106204
- Logarithmic derivative of A112934 such that a(n)=(1/2)*A112934(n+1) for n>0, where A112934 equals the INVERT transform of double factorials A001147.at n=5A112935
- Start with 1 and repeatedly reverse the digits and add 55 to get the next term.at n=17A118161
- Triangle read by rows where the n-th row is the first row of M^n, with M the (n+1)-by-(n+1) matrix with (1,3,1,3,1,3,...) on its main diagonal and (3,1,3,1,3,1,...) on its superdiagonal.at n=31A124572