10286
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15960
- Proper Divisor Sum (Aliquot Sum)
- 5674
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4968
- Möbius Function
- -1
- Radical
- 10286
- 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
- 55
- 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
- a(n) = prime(n)*(prime(n+1)-1)/2.at n=33A014303
- a(n) = n*(15*n + 1)/2.at n=37A022273
- Triangular array associated with Schroeder numbers.at n=42A033878
- Numbers k such that the largest prime factor of k is equal to the sum of primes dividing k+1 (with repetition).at n=12A071861
- Matrix square of triangle A063967.at n=36A091700
- Column 0 of triangle A091700.at n=8A091702
- Inverse of the Delannoy triangle.at n=38A103136
- Number of returns to the x-axis from above (i.e., d steps hitting the x-axis) in all Grand Motzkin paths of length n.at n=8A109196
- Riordan array ((1-x+sqrt(1+6*x+x^2))/2, (sqrt(1+6*x+x^2)-x-1)/2).at n=48A112477
- T(n, k) counts Schroeder n-paths whose ascent starting at the initial vertex has length k. Triangle T(n,k), read by rows.at n=38A132372
- Union of A071863 and A071861.at n=37A193458
- Number of partitions p of n such that (maximal multiplicity of the parts of p) >= (number of distinct parts of p).at n=36A240308
- Sum of binomial(n,k) over squarefree k.at n=13A245268
- Numbers k such that (68*10^k - 257)/9 is prime.at n=18A288149
- Sum of all the parts in the partitions of n into 6 squarefree parts.at n=37A308903
- Expansion of Product_{k>=1} 1/(1 - x^k)^(2^k-1).at n=10A319918
- Numbers k such that usigma(uphi(k)) = uphi(usigma(k)), where usigma is the sum of unitary divisors function (A034448) and uphi is the unitary totient function (A047994).at n=32A329730
- a(n) is the smallest number k such that Sum_{j=1..k} (-1)^omega(j) = -n, where omega(j) is the number of distinct primes dividing j.at n=41A346456
- Number of partitions of n such that 4*(smallest part) = (number of parts).at n=58A350896
- Sphenic numbers k such that none of k-2, k-1, k+1 and k+2 is squarefree.at n=28A362561