12804
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
- 24
- Divisor Sum
- 32928
- Proper Divisor Sum (Aliquot Sum)
- 20124
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3840
- Möbius Function
- 0
- Radical
- 6402
- 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
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 169
- 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
- Column of Motzkin triangle.at n=7A005325
- a(n) = T(2n,n+1), where T is the array in A026300.at n=6A026306
- a(1) = 1; a(m+1) = sum_{k=1 to m} [max(m, a(k))].at n=13A056112
- Number of peaks at even level in all symmetric Dyck paths of semilength n+2.at n=12A088662
- Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1), U=(1,2), or d=(1,-1) and having height of the first peak equal to k.at n=31A108437
- Triangle, read by rows, where the g.f. of row n divided by (1-x)^n yields the g.f. of column n in the triangle A122888, for n>=1.at n=43A122890
- Secondary diagonal of triangle A122890.at n=5A122892
- Number of sequences with terms 1, 2 or 3 summing to n with no three consecutive 1's.at n=18A123908
- This is to A139025 as A139025 to A014688, see A139025 for details.at n=22A139026
- 4 times octagonal numbers: a(n) = 4*n*(3*n-2).at n=33A153794
- Number of cubic equations ax^3 + bx^2 + cx + d = 0 with integer coefficients |a|,|b|,|c|,|d| <= n, a <> 0, having three real roots, of which at least two are equal.at n=40A155192
- Triangle, read by rows n>=1, where row n is the n-th differences of column n of array A158825, where the g.f. of row n of A158825 is the n-th iteration of x*Catalan(x).at n=37A158830
- a(n) = 13*n^2 + 10*n + 1.at n=31A161587
- a(0)=1, a(1)=6, a(n) = 30*a(n-2) - a(n-1).at n=6A165491
- a(n) is the maximal positive integer m for which exponents of prime(n) and prime(n+1) in the prime power factorization of m! are both powers of 2.at n=42A177498
- a(n) = A000108(n)*A006130(n), where A000108 is the Catalan numbers and A006130(n) = A006130(n-1) + 3*A006130(n-2).at n=6A200312
- Values of the difference d for 6 primes in geometric-arithmetic progression with the minimal sequence {7*7^j + j*d}, j = 0 to 5.at n=7A209205
- Numbers divisible by prime(d) for each digit d in their base-7 representation, none of which may be zero.at n=42A256877
- Number of (n+2)X(3+2) 0..1 arrays with no 3x3 subblock diagonal sum less than the antidiagonal sum or central row sum less than the central column sum.at n=4A258889
- Number of (n+2) X (5+2) 0..1 arrays with no 3 x 3 subblock diagonal sum less than the antidiagonal sum or central row sum less than the central column sum.at n=2A258891