12948
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 32928
- Proper Divisor Sum (Aliquot Sum)
- 19980
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3936
- Möbius Function
- 0
- Radical
- 6474
- 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
- 50
- 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) = n*(17*n + 1)/2.at n=39A022275
- a(n) = Sum_{k=0..n} (k+1) * A026692(n, k).at n=10A026995
- a(n) = Sum_{d dividing n} binomial(2d,d).at n=7A072929
- Smallest a(n) > a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, with a(1)=5.at n=26A076671
- Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=9.at n=26A076674
- A014486-indices of A083932-trees.at n=29A083934
- Numbers for which the sum of the digits is the square root of the product of their digits.at n=26A117720
- Pyramidal 47-gonal numbers.at n=11A130566
- Total sum of squares of number of distinct parts in all partitions of n.at n=21A135348
- Triangular sequence T(n, m) = (p^(n-m)*q^m + p^m*q^(n-m))*A(n+1, m+1), where A(n, m) = (3*n -3*k +1)A(n-1, k-1) + (3*k-2)A(n-1, k), A(n,1)=A(n,n)=1, p=2 and q=3.at n=11A154698
- Triangular sequence T(n, m) = (p^(n-m)*q^m + p^m*q^(n-m))*A(n+1, m+1), where A(n, m) = (3*n -3*k +1)A(n-1, k-1) + (3*k-2)A(n-1, k), A(n,1)=A(n,n)=1, p=2 and q=3.at n=13A154698
- a(n)= n * reversal(n-1) * reversal(n+1).at n=38A160936
- Numbers n such that sigma(lambda(n)) = lambda(sigma(n)).at n=30A173942
- Expansion of 1/(1 - x - x^10 - x^19 + x^20).at n=57A175740
- Number of strings of numbers x(i=1..5) in 0..n with sum i^2*x(i) equal to n*25.at n=22A183956
- Number of nondecreasing strings of numbers x(i=1..n) in -3..3 with sum x(i)^3 equal to 0.at n=36A188271
- Triangle T(n,k) read by rows: Number of non-equivalent ways (mod D_3) to choose k points from an nXnXn triangular grid so that no three of them form a 2X2X2 subtriangle.at n=31A234247
- G.f.: A(x) = exp( Sum_{n>=1} 4^n * x^n/(n*(1+x^n)) ).at n=7A259274
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 294", based on the 5-celled von Neumann neighborhood.at n=41A271134
- Coordination sequence for "reo" 3D uniform tiling.at n=43A299279