10064
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
- 20
- Divisor Sum
- 21204
- Proper Divisor Sum (Aliquot Sum)
- 11140
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4608
- Möbius Function
- 0
- Radical
- 1258
- 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
- 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 partitions into non-integral powers.at n=39A000148
- Expansion of log(1+tanh(tanh(x))).at n=8A009387
- -log(cos(tan(x)))=1/2!*x^2+10/4!*x^4+232/6!*x^6+10064/8!*x^8...at n=3A012240
- Expansion of 1/(1-x^5-x^6-x^7-x^8-x^9-x^10-x^11).at n=43A017842
- Number of open positions in the game Fair Share and Varied Pairs starting with n tokens.at n=33A060463
- Numbers k such that Sum_{i=1..k} phi(i)/gcd(k,i) is an integer.at n=38A066969
- Sum of first n 8-almost primes.at n=10A086061
- a(n) = the definite integral Integral_{0..1} Product_{j=1..n} 4*sin^2(Pi*j*x) dx.at n=24A133871
- Irregular triangle read by rows: the number of hydrocarbon structures that can be drawn with a given number of carbons and units of unsaturation.at n=58A134819
- 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), (0, -1, 0), (0, 1, 1), (1, 1, -1)}.at n=9A148789
- 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, -1, 1), (-1, 0, 0), (0, 1, 1), (1, -1, 0), (1, 1, -1)}.at n=8A149046
- Number of ways to place 5 nonattacking amazons (superqueens) on a 5 X n board.at n=13A174644
- a(n) is the smallest 5-digit number with exactly n divisors, or a(n) = 0 if no such number exists.at n=19A182697
- Constant term of the reduction by x^2 -> x+1 of the polynomial p(n,x) defined below in Comments.at n=8A192383
- Number of -n..n arrays x(0..3) of 4 elements with zero sum and nonzero second differences.at n=11A200554
- a(n) = -a(n-1) - 3*a(n-2) with n>1, a(0)=0, a(1)=1.at n=18A214733
- a(n) = n*(15*n-11)/2.at n=37A226489
- a(n) = 2*( a(n-5) + a(n-8) + a(n-11) ) for n >= 12.at n=39A226592
- The 360 degree spoke (or ray) of a hexagonal spiral of Ulam.at n=29A244803
- Triangle read by rows: T(n,k) is the number of weighted lattice paths in B(n) having k ascents. The members of B(n) are paths of weight n that start at (0,0), end on but never go below the horizontal axis, and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps. An ascent is a maximal sequence of consecutive (1,1)-steps.at n=41A246186