6610
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11916
- Proper Divisor Sum (Aliquot Sum)
- 5306
- 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
- 2640
- Möbius Function
- -1
- Radical
- 6610
- 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
- 49
- 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
- Apply partial sum operator thrice to Fibonacci numbers.at n=14A014162
- Numbers k such that the continued fraction for sqrt(k) has period 21.at n=33A020360
- a(n) = Sum_{k >= 1} floor(3*tau^(n-k)).at n=14A020958
- Expansion of 1/((1-7*x)*(1-9*x)*(1-10*x)).at n=3A020970
- a(n) = T(2n,n+1), T given by A027948.at n=7A027949
- Numbers in which all pairs of consecutive base-5 digits differ by 2.at n=36A033083
- a(0)=2; a(n) is the smallest k > a(n-1) such that the fractional part of k^(1/10) starts with n.at n=41A034075
- Dirichlet convolution of 3^(n-1) with sigma(n).at n=8A034753
- T(n,n-3), array T as in A054106.at n=33A054107
- Local ranks of terms of A057122.at n=39A057124
- Numbers k such that phi(k) divides (sigma(k+2) + sigma(k-2)).at n=39A067245
- Least k such that gcd(prime(k)+1, prime(k+1)+1) = 2n.at n=15A067603
- a(n) = n * (6*n^2 + 6*n + 1).at n=9A094421
- a(n) = (largest digit of n)^(smallest digit of n) + n.at n=49A097385
- A Binet like formula using the Akiyama-Thurston tile roots for a Minimal Pisot theta0 sequence.at n=32A097600
- Number of partitions of n in which every part occurs 1, 4, or 5 times. Also number of partitions of n in which every part is congruent to {1, 3, 4, 5, 7} mod 8.at n=45A100853
- Main diagonal of A101858.at n=42A101863
- A (twin's digits) self-disappearing sequence.at n=37A108988
- A functionally symmetric Polynomial as a triangle of coefficients: p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n - 4)*Sum[(2^m + 2*m )*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=59A146955
- Partial sums of A139250.at n=32A160424