10160
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
- 20
- Divisor Sum
- 23808
- Proper Divisor Sum (Aliquot Sum)
- 13648
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4032
- Möbius Function
- 0
- Radical
- 1270
- Omega Function (Ω)
- 6
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 34
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Number of plane partitions of n with at most two rows.at n=21A000990
- Number of ferrites M_8Y_n that repeat after 6n+40 layers.at n=17A011963
- Positive numbers k such that k and 6*k are anagrams in base 9 (written in base 9).at n=2A023083
- Triangle of coefficients of di-Boustrophedon transform (see A063179) read by rows: Let the original sequence be (U0,U1,...) and the transformed sequence (V0,V2,...), then Vn is a linear combination of U0,...,Un. T(n,m) is the coefficient that goes with Um to get Vn.at n=48A063415
- Multiples of 8 with digit sum 8.at n=26A069543
- Sum of divisors of (prime(n)+1)*(prime(n+1)+1)/4.at n=29A079089
- a(n) = n * (2^n - 8).at n=10A083727
- Row sums of triangle A101224, which is related to the Flavius sieve (A000960).at n=22A101105
- Number of partitions of 2n free of multiples of 5. All odd parts occur with multiplicity 2 or 4. the even parts occur at most twice.at n=33A103257
- From a question about accepting states in certain finite automata.at n=4A124092
- Number of possible values of C(v) = the number of valid mountain-valley assignments for a flat-foldable origami vertex v of degree 2n.at n=22A156209
- Number of right triangles on a (n+1) X 4 grid.at n=25A189808
- Numbers k such that (86*10^k - 329)/9 is prime.at n=21A283236
- Number of maximal irredundant sets in the n-web graph.at n=6A291105
- Sum of the squares of the parts in the partitions of n into two distinct parts.at n=31A294286
- Partial sums of A299254.at n=18A299260
- Expansion of Product_{k>=1} 1/(1 - x^prime(k))^A056768(k).at n=36A321508
- Coefficients of orthogonal polynomials p(n, x) where p(n, 0) is A026150 with 1 prepended. Triangle read by rows, T(n, k) for 0 <= k <= n.at n=60A322941
- Lexicographically first sequence starting with a(1) = 1, with no duplicate term, such that a(n) is the result of a self-additive linear combination of its own digits (concatenated sometimes into substrings).at n=37A323823
- Number of planar 2-connected irreducible graphs with n vertices.at n=6A328977