12232
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 25200
- Proper Divisor Sum (Aliquot Sum)
- 12968
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5520
- Möbius Function
- 0
- Radical
- 3058
- Omega Function (Ω)
- 5
- 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
- 63
- 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
- Consider the trajectory of n under the iteration of a map which sends x to 3x - sigma(x) if this is >= 0; otherwise the iteration stops. The sequence gives values of n which eventually reach 0.at n=23A037159
- Same rule as Aitken triangle (A011971) except a(0,0)=1, a(1,0)=0.at n=47A046934
- Sequence formed from rows of triangle A046934.at n=37A046935
- Seventh column of quintinomial coefficients.at n=10A064056
- Sums of members of groups in A076063.at n=28A076066
- Numbers n such that zero is never reached by iterating the mapping k -> abs(reverse(lpd(k))-reverse(gpf(k))). lpd(k) is the largest proper divisor and gpf(k) is the largest prime factor of k.at n=32A076425
- Sum of smallest parts (counted with multiplicity) of all partitions of n.at n=25A092309
- List of molecules in Hintze-Adami artificial chemistry (see comments for definition).at n=12A101145
- Number of base 12 circular n-digit numbers with adjacent digits differing by 3 or less.at n=5A125322
- Concatenation of first n elements of the divisor function d(n), where d(n) is the number of divisors of n.at n=4A132927
- Sequence representing valid nontrivial 1-dimensional Hashi (a.k.a. Bridges or Hashiwokakero) puzzle orientations.at n=27A143964
- Number of 5-step one space at a time bishop's tours on an n X n board summed over all starting positions.at n=13A187158
- Numbers of rank 10 in the poset of lunar numbers.at n=57A191752
- Number of column-convex permutominoes of size n.at n=5A196275
- Number of 2 X 2 matrices having all terms in {-n,...,0,...,n} and determinant n-1.at n=27A211141
- Elements of the planar rooted trees sub-operad PRT of TN generated by 01.at n=11A231869
- Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that min(x(i) - x(i-1)) < number of distinct parts of p.at n=34A241823
- Molien series for invariants of finite Coxeter group A_11.at n=50A266780
- a(n) = 4*n*(n^2 - 3*n - 1)/3.at n=22A275876
- Number of Dyck paths of semilength n such that the minimal number of peaks over all positive levels equals seven.at n=11A288546