10187
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
- 4
- Divisor Sum
- 10416
- Proper Divisor Sum (Aliquot Sum)
- 229
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9960
- Möbius Function
- 1
- Radical
- 10187
- Omega Function (Ω)
- 2
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 34
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = least k such that 1+2+...+k >= E{1,2,...,n}, where E is the 3rd elementary symmetric function.at n=34A027917
- "BFK" (reversible, size, unlabeled) transform of 2,1,1,1...at n=26A032044
- Denominators of continued fraction convergents to sqrt(262).at n=7A041491
- G.f.: ( 1 - x^2 - sqrt( 1 - 2*x^2 - 4*x^3 - 3*x^4 ) ) / ( 2*x^3 ).at n=17A050253
- Semiprimes whose factors are decimal palindromes when concatenated, omitting multiples of primes less than 11.at n=30A144719
- T(n,k) = 2*A046802(n,k) - A007318(n,k), triangle read by rows (0 <= k <= n).at n=31A168287
- T(n,k) = 2*A046802(n,k) - A007318(n,k), triangle read by rows (0 <= k <= n).at n=32A168287
- Total number of parts that are neither the smallest part nor the largest part in all partitions of n.at n=27A182977
- The largest number m such that sigma(m) = A007368(n), where A007368(n) = the smallest k such that sigma(x) = k has exactly n solutions.at n=21A184394
- a(n) = n^3 - 4*n^2 + 6*n - 2.at n=20A188377
- Row sums of triangle A132623.at n=6A208678
- a(n) = Sum_{i=0..n} digsum_6(i)^4, where digsum_6(i) = A053827(i).at n=21A231675
- Number of strict partitions of 2n + 1 having 1 more even part than odd, so that there is at least one ordering of the parts in which the even and odd parts alternate, and the first and last terms are even.at n=38A239873
- Number of equivalence classes of two-layer networks on n channels modulo permutations.at n=16A244484
- Numbers k such that k divides the sum of the first k primes with odd indices.at n=7A263549
- Sum over all partitions of n of the bitwise AND of the parts.at n=51A306901
- Triangle read by rows where T(n,k) is the number of unlabeled connected multigraphs with loops with n edges and k vertices.at n=59A322115