12064
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 26460
- Proper Divisor Sum (Aliquot Sum)
- 14396
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5376
- Möbius Function
- 0
- Radical
- 754
- Omega Function (Ω)
- 7
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 68
- 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
- Low-temperature series in exp(4J/kT) for antiferromagnetic susceptibility for the Ising model on square lattice.at n=8A002979
- Fibonacci sequence beginning 0, 32.at n=14A022366
- Numerators of continued fraction convergents to sqrt(829).at n=7A042600
- Half the number of 3 X n binary arrays with no path of adjacent 1's or adjacent 0's from top row to bottom row.at n=5A069429
- Half the number of n X 6 binary arrays with no path of adjacent 1's or adjacent 0's from top row to bottom row.at n=1A069444
- In the interior of a regular 2n-gon with all diagonals drawn, the number of points where exactly three diagonals intersect.at n=24A101363
- 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 have k peaks of the form ud.at n=22A108446
- Let n = a_1a_2...a_k, where the a_i are digits. a(n) = least multiple of n of the type b_1a_1b_2a_2...a_kb_{k+1}, obtained by inserting single digits b_i in the gaps and both ends; 0 if no such number exists.at n=25A110735
- Inverse Moebius transform of the shifted tetrahedral numbers.at n=38A116963
- Numerator of the sum of all matrix elements of n X n matrix M[i,j]=CatalanNumber[i]/CatalanNumber[j], where CatalanNumber[k]=(2k)!/k!/(k+1)!=A000108[k].at n=4A120306
- Number of conjugated cycles composed of ten carbons in (n,n)-nanotubes in terms of the number of naphthalene units.at n=7A121255
- 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, 0), (-1, 0, 0), (0, 1, 1), (1, 0, -1), (1, 1, 1)}.at n=7A150830
- 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, 0), (-1, 1, 0), (0, 1, 1), (1, 0, -1), (1, 1, 1)}.at n=7A150831
- a(n) = 2*n*(7*n + 5).at n=29A195027
- a(n) = Fibonacci(n)*A034896(n) for n >= 1, with a(0)=1, where A034896 lists the number of solutions to a^2 + b^2 + 3*c^2 + 3*d^2 = n.at n=14A205971
- Number of nX4 0..2 arrays with no element equal to more than one of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=5A281135
- Number of nX6 0..2 arrays with no element equal to more than one of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=3A281137
- T(n,k)=Number of nXk 0..2 arrays with no element equal to more than one of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=39A281139
- T(n,k)=Number of nXk 0..2 arrays with no element equal to more than one of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=41A281139
- Number of non-isomorphic abstract almost-equidistant graphs on n vertices in R^6. A graph G is abstract almost-equidistant in R^6 if the complement of G does not contain K_3 and G does not contain K_8 nor K_{1,3,3,3}.at n=9A296418