13083
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
- 12
- Divisor Sum
- 20520
- Proper Divisor Sum (Aliquot Sum)
- 7437
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7392
- Möbius Function
- 0
- Radical
- 1869
- Omega Function (Ω)
- 4
- 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
- 151
- 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
- no
- Odd
- yes
Appears in sequences
- Irregular triangle read by rows: Whitney numbers of the second kind a(n,k), n >= 1, k >= 0, for the star poset.at n=44A007799
- a(n) = a(n-1) + the number of primes <= a(n-1).at n=43A061535
- a(n) = round(10000*log(n/10)).at n=36A104077
- Triangular matrix T, read by rows, that satisfies: SHIFT_LEFT(column 0 of T^p) = p*(column p+3 of T), or [T^p](m,0) = p*T(p+m,p+3) for all m>=1 and p>=-3.at n=39A111544
- Column 3 of triangle A111544; also found in column 0 of triangle A111549, which equals the matrix logarithm of A111544.at n=5A111547
- Matrix logarithm of triangle A111544.at n=21A111549
- Riordan array ((1+x)/(1-2x),x(1+x)/(1-2x)).at n=49A116412
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 1), (1, 0, -1), (1, 0, 0), (1, 1, 1)}.at n=7A150850
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (0, 0, 1), (0, 1, 0), (1, 0, 0)}.at n=8A151029
- a(n) = 441*n^2 - 488*n + 135.at n=5A157730
- Triangle of coefficients of polynomials v(n,x) jointly generated with A210749; see the Formula section.at n=48A210750
- G.f. B(x) satisfies: B(x) = x + 3*A(x)*C(x), where A(x) = x + 2*B(x)*C(x) and C(x) = x + 5*A(x)*B(x).at n=5A229809
- Triangular array: row n gives the coefficients of the polynomial p(n,x) defined in Comments.at n=50A249251
- Number of Hamiltonian paths in the graph on n vertices {1,...,n}, with i adjacent to j iff |i-j| in {1,3}.at n=20A302119
- a(n) is the number of sets modulo n which can be formed by a finite arithmetic sequence.at n=30A331503
- Irregular table read by rows: Take a triangle with Pythagorean triple leg lengths with all diagonals drawn, as in A332978. Then T(n,k) = number of k-sided polygons in that figure for k >= 3 where the legs are divided into unit length parts.at n=18A333135
- Expansion of g.f. (x^4*(x^2 + 2*x + 3))/((x - 1)^4*(x + 1)*(x^2 + x + 1)).at n=44A349975
- Maximum coefficient of (1 - x) * (1 - x^3) * (1 - x^6) * ... * (1 - x^(n*(n+1)/2)).at n=50A369984
- Maximum of the absolute value of the coefficients of (1 - x) * (1 - x^3) * (1 - x^6) * ... * (1 - x^(n*(n+1)/2)).at n=50A369985