10610
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19116
- Proper Divisor Sum (Aliquot Sum)
- 8506
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4240
- Möbius Function
- -1
- Radical
- 10610
- 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
- 99
- 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
- Coordination sequence for sigma-CrFe, Position Xb.at n=26A009960
- Numerators of continued fraction convergents to sqrt(131).at n=5A041238
- a(n) = Sum_{i=0..n} T(i,n-i) where T is A049627.at n=46A049628
- Write fundamental unit for real quadratic field of discriminant n as x + y*omega; sequence gives values of x for n == 3 mod 4.at n=28A053372
- a(n) = prime(n)^2 + 1.at n=26A066872
- Interprimes which are of the form s*prime, s=10.at n=24A075285
- Let p = n-th prime of the form 4k+3, take smallest solution (x,y) to the Pellian equation x^2 - p*y^2 = 1 with x and y >= 1; sequence gives value of x.at n=16A081231
- Let p = n-th prime, take smallest solution (x,y) to the Pellian equation x^2 - p*y^2 = 1 with x and y >= 1; sequence gives value of x.at n=31A081233
- Number of almost base-2 palindromic primes (A095743) in range ]2^n,2^(n+1)].at n=25A095753
- Number of squares on infinite half chessboard at <=n knight moves from a fixed point on the edge.at n=39A098498
- a(n) is the sum of the (1,2)- and (1,3)-entries of the matrix P^n + T^n, where the 3 X 3 matrices P and T are defined by P = [0,1,0; 0,0,1; 1,0,0] and T = [0,1,0; 0,0,1; 1,1,1].at n=17A109523
- Diagonal sums of Riordan array (1/(1+x),x(1+x)/(1-x)).at n=18A112476
- a(1) = 335; a(n) is the smallest k > a(n-1) such that k*A002110(n)^30 - 1 is prime.at n=38A119760
- Both k and its reverse are one more than a square.at n=13A124664
- Least K such that K*(prime(100*n)^(100*n))-1 is prime with prime(n)=n-th prime.at n=20A129245
- Numbers whose square is a permutational number A134640.at n=30A134742
- Product(1 + a(n)*x^n, n=1..infinity) = sum(F(k+1)*x^k, k=1..infinity) = 1/(1-x-x^2), where F(n) = A000045(n) (Fibonacci numbers).at n=25A147542
- a(n) = 81*n^2 - 90*n + 26.at n=12A154295
- a(n) = 6561*n^2 - 9558*n + 3482.at n=2A156773
- Number of binary strings of length n with no substrings equal to 0001 or 1000.at n=11A164398