12234
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 24480
- Proper Divisor Sum (Aliquot Sum)
- 12246
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 4076
- Möbius Function
- -1
- Radical
- 12234
- Omega Function (Ω)
- 3
- 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
- yes
- 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
- Expansion of 1/(1-x^10-x^11-x^12-x^13-x^14-x^15-x^16-x^17-x^18-x^19-x^20).at n=71A017896
- Positive numbers k such that k and 3*k are anagrams in base 5 (written in base 5).at n=8A023062
- Convolution of A000201 with itself.at n=29A023663
- Number of partitions satisfying (cn(2,5) = cn(3,5) and cn(0,5) <= cn(1,5) and cn(0,5) <= cn(4,5) and cn(2,5) <= cn(1,5) and cn(2,5) <= cn(4,5)).at n=50A036811
- p such that p^4 + q^4 = r^4 + s^4 = a(n).at n=38A088728
- Let A denote the sequence; A is equal to the union of the self-convolutions A^2 and A^3, with terms in ascending order by size.at n=30A090845
- List of strings in lexicographic order with property that for the 2^(m-1) strings of length m, the first entry is 1, the second distinct entry (reading from left to right) is 2, the third distinct entry is 3, etc.at n=26A096299
- Triangle T read by rows: matrix product of Pascal and Catalan triangle.at n=37A104259
- a(n) = min{p + q + r + ...} where p,q,r,... are distinct unary numbers - containing only ones, i.e., of the form (10^k - 1)/9 - formed by using a total of n ones.at n=11A110380
- Numbers which are sum of distinct unary numbers (containing only ones), i.e., numbers which are sum of distinct numbers of the form (10^k - 1)/9.at n=26A110382
- n = Sum_{b} c_b*b! in the factorial base rewritten by c_b-fold repetition of b, b=1,2,3,....at n=34A111095
- Riordan array (1, (1/(1-x))c(x/(1-x))), c(x) the g.f. of A000108.at n=47A155887
- a(n) = floor(n^(n^(1/3))).at n=24A157254
- Smallest multiple of 3 such that decimals digits 1, ..., k (k = 1, ..., 9) and 0 appear in any order.at n=3A178341
- Number of (w,x,y,z) with all terms in {1,...,n} and w^3<x^3+y^3+z^3.at n=11A212097
- Self-convolution square of A090845.at n=17A222082
- Elements of the planar rooted trees sub-operad PRT of TN generated by 01.at n=13A231869
- Numbers k such that k divides 1 + Sum_{j=1..k} prime(j)^9.at n=15A232964
- Number of nX5 0..3 arrays with no element equal to zero plus the sum of elements to its left or two plus the sum of elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 4.at n=2A240380
- T(n,k)=Number of nXk 0..3 arrays with no element equal to zero plus the sum of elements to its left or two plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 4.at n=23A240381