13436
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 23520
- Proper Divisor Sum (Aliquot Sum)
- 10084
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6716
- Möbius Function
- 0
- Radical
- 6718
- 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
- 138
- 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 rooted trees with n nodes and omega-valency 1.at n=13A003120
- Carlitz-Riordan q-Catalan numbers (recurrence version) for q=-5.at n=4A015100
- Multiplicity of highest weight (or singular) vectors associated with character chi_182 of Monster module.at n=39A034570
- Triangle T(n,d) (listed row-wise: T(1,1)=1, T(2,1)=1, T(2,2)=1, T(3,1)=2, T(3,2)=2, T(3,3)=1, ...) giving the number of n-edge general plane trees with root degree d that are fixed by the two-fold application of Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees).at n=67A079218
- Numbers n such that (sigma(n-2)+sigma(n+2))/2 = sigma(n).at n=34A099631
- Number of partitions of n*(n+1)/2 with at most four parts that can be obtained from grouping (with parentheses) a permutation of the sum 1+2+...+n.at n=15A160438
- Vertex number of a rectangular spiral related to Fibonacci numbers and prime numbers. The distances between nearest edges of the spiral that are parallel to the initial edge are the Fibonacci numbers, while the distances between nearest edges perpendicular to the initial edge are the prime numbers.at n=35A160794
- Number of strings of numbers x(i=1..5) in 0..n with sum i^3*x(i) equal to 125*n.at n=34A184260
- Sums of squares of terms in rows of Losanitsch's triangle (A034851).at n=9A211208
- A(n,k) is the n-th Carlitz-Riordan q-Catalan number (recurrence version) for q = -k; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=49A290789
- Expansion of Product_{i>=1, j>=1, k>=1} (1 + x^(i*j*k))/(1 - x^(i*j*k)).at n=11A305050
- Given the associative array U(n,k) described below, numbers m > 5 such that [m-3..m+3] are not in U(n,k) (excluding the first row and column).at n=9A345473