10352
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 20088
- Proper Divisor Sum (Aliquot Sum)
- 9736
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5168
- Möbius Function
- 0
- Radical
- 1294
- Omega Function (Ω)
- 5
- 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
- 42
- 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 permutations of an n-sequence discordant with three given permutations (see reference) in n-3 places.at n=5A000380
- Number of points on surface of truncated cube: a(n) = 46*n^2 + 2 for n > 0.at n=15A005911
- Number of partitions of n that do not contain 9 as a part.at n=34A027343
- Number of factorizations into distinct factors with 3 levels of parentheses indexed by prime signatures. A050349(A025487).at n=42A050350
- Number of different values obtained by evaluating all different parenthesizations of 1/2/3/4/.../n.at n=17A078389
- Triangle read by rows giving number of circular permutations of n letters such that all letters are displaced by no more than k places from their original position.at n=39A094315
- a(n) = ((1+sqrt(8))*(2+sqrt(2))^n + (1-sqrt(8))*(2-sqrt(2))^n)/2.at n=7A111566
- Number of permutations of length n which avoid the patterns 231, 12345.at n=12A116844
- Triangle read by rows: T(n,k) is the number of permutations p of {1,2,...,n} such that the set {p(i)-i, i=1,2,...,n} has exactly k elements (1<=k<=n).at n=34A125182
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (-1, 0, 1), (0, -1, 1), (0, 1, -1), (1, 0, 1)}.at n=8A149361
- a(n+1) = a(n) + floor(a(n)/4) with a(0)=4.at n=37A182305
- a(n) = 4*n^2 - n - 1.at n=51A185950
- Number of 5-step self-avoiding walks on an n X n square summed over all starting positions.at n=11A188150
- Let y=(1-sqrt(1-4*z))/(1+sqrt(1-4*z)) denote the g.f. for the Catalan numbers (A000108); sequence has g.f. sum(k>=1, y^(2^k)/(1+y^(2^(k+1))) ).at n=9A191606
- Number of -n..n arrays x(0..3) of 4 elements with zero sum and no two consecutive zero elements.at n=11A199531
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and w^2>2x^2+2y^2.at n=22A211633
- Expansion of Product_{k>=1} 1/(1 - x^(2*k+1))^k.at n=40A263150
- Number of n X 4 binary arrays with rows and columns lexicographically nondecreasing and row and column sums nonincreasing.at n=29A266543
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 422", based on the 5-celled von Neumann neighborhood.at n=37A272087
- a(n) = 12*n^2 + 10*n - 30.at n=29A277982