6590
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11880
- Proper Divisor Sum (Aliquot Sum)
- 5290
- 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
- 2632
- Möbius Function
- -1
- Radical
- 6590
- 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
- 137
- 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
- yes
- Odd
- no
Appears in sequences
- Population of "Triangle" cellular automaton at n-th generation.at n=37A018189
- Path-counting array T(i,j) obtained from array t in A038792 by T(i,j)=t(2i+1,j).at n=52A038738
- T(n,n-2), array T as in A038738.at n=7A038739
- T(2n+5,n), array T as in A038792.at n=7A038798
- Number of primes between n*100000 and (n+1)*100000.at n=37A038825
- Numbers k such that k^12 == 1 (mod 13^3).at n=35A056086
- Number of self-conjugate three-quadrant Ferrers graphs that partition n.at n=46A059777
- Interprimes which are of the form s*prime, s=10.at n=18A075285
- a(n) = prime(n) + prime(n^2).at n=28A092504
- a(n) = Sum_{k=0..floor(n/2)} binomial(n-k+4, k).at n=15A099572
- Sum of the sizes of the Durfee squares of all partitions of n into distinct parts.at n=43A116859
- Start with 1 and repeatedly reverse the digits and add 67 to get the next term.at n=25A118214
- Maximal length of rook tour on an n X n+3 board.at n=19A152134
- a(n) = 169*n - 1.at n=38A158219
- G.f. A satisfies -x+(1+x^3-x)*A+(x^4-x^2)*A^2+(x^5-x^3)*A^3-x^4*A^4 = 0.at n=15A177794
- Where zeros occur in the 1-0 race in the binary expansion of Pi-3; that is, n such that A174832(n) = 0.at n=23A178980
- Triangle of coefficients of polynomials v(n,x) jointly generated with A209773; see the Formula section.at n=47A209776
- Number of partitions of n avoiding any 3-term arithmetic progression.at n=50A238571
- Number of partitions of n such that (least part) > (multiplicity of least part).at n=46A240176
- Numbers m such that A166133(m+1) = A166133(m)^2 - 1.at n=16A256703