6064
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 11780
- Proper Divisor Sum (Aliquot Sum)
- 5716
- 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
- 3024
- Möbius Function
- 0
- Radical
- 758
- Omega Function (Ω)
- 5
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 62
- 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
- yes
- Odd
- no
Appears in sequences
- Numerators of convergents to cube root of 2.at n=10A002352
- Poincaré series [or Poincare series] of Lie algebra associated with a certain braid group.at n=11A007993
- Seidel's triangle, read by rows.at n=39A014781
- Numbers k such that the continued fraction for sqrt(k) has period 68.at n=15A020407
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (odd natural numbers).at n=21A024463
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = (odd natural numbers).at n=20A025083
- Expansion of (theta_3(z)*theta_3(19z) + theta_2(z)*theta_2(19z))^4.at n=20A028644
- Numbers having period-4 6-digitized sequences.at n=34A031197
- Number of partitions of n with equal number of parts congruent to each of 2 and 3 (mod 5).at n=40A035559
- Number of partitions in parts not of the form 7k, 7k+2 or 7k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 2 are greater than 1.at n=48A035938
- Number of disconnected labeled graphs with n nodes.at n=6A054592
- a(n) = round(n^3/12) - floor(n/4)*floor((n+2)/4).at n=42A090676
- Expansion of q / (chi(-q) * chi(-q^23)) in powers of q where chi() is a Ramanujan theta function.at n=54A092833
- Triangle read by rows: Each row is constructed by forming the partial sums of the previous row, reading from the right and at every other row repeating the final term.at n=38A099959
- Number of partitions of n in which each odd part has odd multiplicity.at n=35A131942
- Triangle, read by rows, equal to P^4, where triangle P = A135880; also equals Q^2, where triangle Q = P^2 = A135885.at n=16A135891
- Greatest number m such that the fractional part of e^A091560(m) >= 1-(1/m).at n=9A153707
- a(n) is the smallest integer > a(n-1) such that a(n) shares no digit with a(n-1) and c=a(n-1)+a(n), and also a(n-1) shares no digit with c.at n=20A166461
- Inverse of 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=48A178104
- Number of -7..7 arrays x(0..n-1) of n elements with zero sum, and adjacent elements not equal modulo three (with -1 modulo 3 = 2).at n=4A199908