13190
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
- 8
- Divisor Sum
- 23760
- Proper Divisor Sum (Aliquot Sum)
- 10570
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5272
- Möbius Function
- -1
- Radical
- 13190
- Omega Function (Ω)
- 3
- 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
- 125
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- Coefficients arising in the enumeration of configurations of linear chains.at n=8A038748
- Numbers n such that phi(2n+1) = sigma(n).at n=37A067229
- Sum of primes between successive pairs of twin primes.at n=29A078731
- Even elements of A082931.at n=42A082933
- Number of consecutive prime runs of 6 primes congruent to 3 mod 4 below 10^n.at n=7A092652
- Numbers k such that binomial(6k, k) + 1 is prime.at n=20A125245
- Number of non-isomorphic maximal independent sets of the n-cycle graph.at n=49A127685
- G.f.: A(x) = exp( Sum_{n>=1} sigma(n^2)*x^n/n ), a power series in x with integer coefficients.at n=14A156303
- Integers whose binary digits "1" define, if sorted into a quadrant shape whose right angle lies in a Go board corner, same colored Go stones that surely live all, but not if any stone is omitted.at n=25A166537
- Least even k such that sfdf(k-3) > sfdf(k-1) >= A050376(n), where sfdf(n) is the smallest Fermi-Dirac factor of n (A223490).at n=31A244343
- Least even k such that sfdf(k-3) > sfdf(k-1) >= A050376(n), where sfdf(n) is the smallest Fermi-Dirac factor of n (A223490).at n=32A244343
- Least even k such that sfdf(k-3) > sfdf(k-1) >= A050376(n), where sfdf(n) is the smallest Fermi-Dirac factor of n (A223490).at n=33A244343
- Solution of the complementary equation a(n) = 2*a(n-1) - a(n-2) + b(n-1), where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=39A294866
- Expansion of Product_{k>0} theta_3(q^(2*k-1))/theta_3(q^(2*k)), where theta_3() is the Jacobi theta function.at n=32A321026
- Records in A338338.at n=48A338348
- Expansion of (4*x^5 - 9*x^4 + 17*x^3 - 15*x^2 + 6*x - 1)/((2*x - 1)^2*(x - 1)^3).at n=11A339032
- a(n) = Sum_{k=0..n} binomial(n, k)^2 * hypergeom([(k-n)/2, (k-n+1)/2], [k+2], 4).at n=7A344502
- a(n) = Sum_{k=1..n} binomial(2*k, k) * sigma(k).at n=5A356344
- a(n) = greatest number of unrestricted partitions between successive strict partitions of n, with partitions listed in Mathematica order.at n=46A366883
- Number of distinct possible binary ranks of integer partitions of n, where the binary rank of a partition y is given by Sum_i 2^(y_i-1).at n=46A373120