10436
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 18270
- Proper Divisor Sum (Aliquot Sum)
- 7834
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5216
- Möbius Function
- 0
- Radical
- 5218
- Omega Function (Ω)
- 3
- 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
- 55
- 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
- G.f.: 1/((1-x)*(1-x^2)*(1-x^3)^2*(1-x^4)*(1-x^5)).at n=45A003402
- Number of alternating sign n X n matrices symmetric with respect to both diagonals.at n=9A005162
- Numbers k such that the continued fraction for sqrt(k) has period 78.at n=32A020417
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique value such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 3.at n=45A050032
- a(n) = a(n-1) + a(m) for n >= 3, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 2.at n=45A050048
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 3.at n=45A050064
- Number of alternating sign 2n X 2n matrices invariant under flips in both diagonals.at n=4A057629
- n*10^2-1, n*10^2-3, n*10^2-7 and n*10^2-9 are all prime.at n=18A064976
- Expansion of 1/(1-x-x^3-x^6).at n=23A120415
- Poincaré series [or Poincare series] P(C_{3,2}(0); t).at n=27A124636
- Numbers such that the sum of the factorials of the digits of the cube is a square.at n=31A126076
- a(n) = floor((x^n - (1-x)^n)/sqrt(2)+ 1/2) where x = (sqrt(2)+1)/2.at n=50A136421
- a(n) = 2*(n^3 + n^2 + n - 1).at n=17A155120
- Number of (n+2) X 3 binary arrays avoiding patterns 001 and 110 in rows, columns and nw-to-se diagonals.at n=20A202440
- Number of 2 X 2 matrices with all elements in {0,1,...,n} and determinant >n.at n=12A210291
- Number of partitions p of n such that the number of parts having multiplicity 1 is a part and max(p) - min(p) is a part.at n=45A241447
- Number of length n+4 0..1 arrays with at most one downstep in every n consecutive neighbor pairs.at n=34A255995
- G.f.: x * Product_{k>=1} (1 + a(k)*(-x)^k)^((-1)^k).at n=12A308246
- Number of compositions (ordered partitions) of n into distinct parts, the least being 7.at n=60A339170
- Smallest even fundamental discriminant k such that h(-k) = 2n, where h(D) is the class number of the quadratic field with discriminant D; or 0 if no such k exists.at n=41A344072