13340
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
- 24
- Divisor Sum
- 30240
- Proper Divisor Sum (Aliquot Sum)
- 16900
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4928
- Möbius Function
- 0
- Radical
- 6670
- Omega Function (Ω)
- 5
- 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
- yes
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 182
- 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
- a(n) = (3*n+1)*(3*n+2).at n=38A001504
- z-value of the solution (x,y,z) to 5/n = 1/x + 1/y + 1/z satisfying 0 < x < y < z and having the largest z-value. The x and y components are in A075249 and A075250.at n=43A075251
- Number of log-concave paths of length n starting from the origin (0,0) with steps from {N=(0,1), E=(1,0) and S=(0,-1)} that stay in the second octant and never touch the line y=x except possibly at the beginning or the end.at n=15A079280
- Sum of largest parts of all partitions of n into odd parts.at n=38A092322
- a(n) = 4*n*(4*n - 1).at n=29A104188
- a(n) = (2*n^3 + 5*n^2 - 13*n)/2.at n=22A162262
- Number of ways to place 3 nonattacking knights on an n X n board.at n=6A172134
- a(n) = (7*n + 3)*(7*n + 4).at n=16A177071
- a(n) = n*(17*n - 13)/2.at n=40A180232
- Number of partitions p of n such that (number of even numbers in p) >= (number of odd numbers in p).at n=38A241639
- Expansion of f(-x^3, -x^5) * f(x^3, x^13) / (f(-x, -x^2) * f(-x^8, -x^16)) in powers of x where f(, ) is Ramanujan's general theta function.at n=41A258939
- Numbers k such that A090086(k), the smallest pseudoprime to base k (not necessarily exceeding k), is a Carmichael number.at n=20A293203
- Number of integer partitions of n whose multiplicities appear with distinct multiplicities.at n=40A325329
- Number of compositions (ordered partitions) of n into at most 5 nonprime parts.at n=47A347798
- Perimeters of more than one primitive 60-degree integer triangle.at n=39A350039
- Numbers k such that the odd part of sigma(sigma(k)) is equal to the odd part of sigma(k).at n=35A353365
- Expansion of Sum_{n>=0} Product_{k=0..n} (x^k*(1+x)^(n-k) + x^(n-k)*(1+x)^k).at n=9A370241
- Order 3 perimeter magic squares of magic sum n, all elements distinct and 1 in the set; bracelet symmetry.at n=35A382455