13290
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 31968
- Proper Divisor Sum (Aliquot Sum)
- 18678
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3536
- Möbius Function
- 1
- Radical
- 13290
- 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
- yes
- 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) = (n^3 + 5*n + 18)/6.at n=45A060163
- Number of triangulations of the cyclic polytope C(n, n-4).at n=20A066342
- a(n) = (n+2)*2^(n-1) - 2*n.at n=11A066368
- Numbers k such that T(k) = T(A072522(k)) + T(A072522(k+1)), T(i) being the triangular numbers.at n=24A080824
- Numbers with no 1's in base 3 & 4 expansions.at n=35A117496
- Number of 10 X 10 arrays of squares of integers, symmetric about both diagonal and antidiagonal, with all rows summing to n.at n=2A156403
- Number of n X n arrays of squares of integers, symmetric about both diagonal and antidiagonal, with all rows summing to 2.at n=8A156430
- Number of nondecreasing integer sequences of length 13 with sum zero and sum of absolute values 2n.at n=13A158147
- Number of permutations of 1..n+5 with the number moved left exceeding the number moved right by n or more.at n=5A179580
- Number of numerical semigroups of multiplicity n and genus n+2.at n=43A180739
- Numbers of espalier polycubes of a given volume in dimension 5.at n=21A229925
- Triangular array read by rows: row n shows the coefficients of the polynomial u(n) = c(0) + c(1)*x + ... + c(n)*x^(n) which is the numerator of the n-th convergent of the continued fraction [k, k, k, ... ], where k = (x + 1)/(x + 2).at n=39A231774
- Number of partitions p of n such that 4*min(p) is a part of p.at n=38A238591
- Number of length n permutations avoiding (132,{2},{}) and (123,{},{1}).at n=11A249563
- Numbers k such that R_k + 10 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=7A256721
- Number of (n+2)X(2+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00001011.at n=8A260495
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 377", based on the 5-celled von Neumann neighborhood.at n=26A271463
- Expansion of (1 + x + x^2)/(1 - x - 3*x^2 - x^3 + x^4).at n=11A280758
- a(n) is the position of first occurrence of n^2 in the concatenation of the positive integers in decimal representation.at n=59A290647
- a(n) is the number of edges formed by n-secting the angles of a pentagon.at n=33A335555