13430
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
- 16
- Divisor Sum
- 25920
- Proper Divisor Sum (Aliquot Sum)
- 12490
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4992
- Möbius Function
- 1
- Radical
- 13430
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 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
- a(n) = Sum_{h=0..n, k=0..n} T(h,k), array T counting knights' moves as in A049604.at n=32A047881
- Numbers whose set of base 11 digits is {0,A}, where A base 11 = 10 base 10.at n=11A097257
- a(n) = 5*a(n-1) - a(n-2), a(0) = 3, a(1) = 25.at n=5A099868
- Numerator of Euler(n, 2/19).at n=4A156662
- Number of peakless Motzkin paths of length n having no (1,0)-steps at levels 0,2,4,... .at n=20A190165
- Number of nondecreasing -n..n vectors of length 3 whose dot product with some nondecreasing -n..n vector equals 3.at n=21A226411
- Sum over all partitions of n of the number of distinct parts i of multiplicity i - 1.at n=39A277101
- Expansion of Sum_{i>=1} x^(i*(i+1)/2)/(1 - x^(i*(i+1)/2)) / Product_{j>=1} (1 - x^(j*(j+1)/2)).at n=56A281615
- Numbers k such that phi(k, 2) = phi(k+1, 2), where phi(k, 2) = A002472(k).at n=13A301868
- Number of parts in all partitions of n with largest multiplicity four.at n=29A320374
- Triangle read by rows: Take a pentagram with all diagonals drawn, as in A331906. Then T(n,k) = number of k-sided polygons in that figure for k = 3, 4, ..., n+2.at n=36A331907
- Number of integer partitions of n with integer alternating product.at n=42A347446
- G.f.: Product_{k >= 0} ((1 + x^(2*k+1)) / (1 - x^(2*k+1)))^k.at n=31A361008
- Expansion of 1/sqrt((1-x^5)^2 - 4*x^2).at n=16A383568
- Antidiagonal sums of the array A389800.at n=9A390581