10036
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 19012
- Proper Divisor Sum (Aliquot Sum)
- 8976
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4608
- Möbius Function
- 0
- Radical
- 5018
- Omega Function (Ω)
- 4
- 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
- 135
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 74.at n=35A020413
- a(n) = A053061(n)/n.at n=35A061082
- a(n) = smallest k such that the Reverse and Add! trajectory of A063048(n) joins the trajectory of k.at n=35A089493
- Index of first occurrence of n in A091853, or 0 if no such number exists.at n=38A091854
- a(n) = 8 - 12*n + 5*n^2.at n=45A145995
- Numbers k such that the sum of the decimal digits of k is a substring of k, of k^2 and of k^3.at n=33A162017
- Total number of configurations that appear in the cycles, in the glass worms (or vers de verres) game with n glasses.at n=11A176336
- T(n, k) = Sum_{i=0, n} (Sum_{j=0, k} C(i+j,i) * C(n-i+j,n-i) * C(i+k-j,k-j) * C(n-i+k-j,n-i)).at n=40A186753
- Number of n X 1 0..3 arrays with rows and columns lexicographically nondecreasing and every element equal to at least one horizontal or vertical neighbor.at n=40A201618
- Number of 1-separable partitions of n; see Comments.at n=43A239467
- Numbers k such that A084937(3k) > A084937(3k+1).at n=22A249689
- Relative of Hofstadter Q-sequence.at n=39A283892
- Number of nX5 0..1 arrays with every element unequal to 0, 1, 3 or 4 king-move adjacent elements, with upper left element zero.at n=11A303805
- Index position of {3}^n within the list of partitions of 3n in canonical ordering.at n=11A332720
- E.g.f.: Product_{k>=1} 1/(1 - (exp(x) - 1)^k)^(1/k!).at n=6A345756