12266
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 18402
- Proper Divisor Sum (Aliquot Sum)
- 6136
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6132
- Möbius Function
- 1
- Radical
- 12266
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- yes
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 61.at n=13A020400
- Numbers whose base-4 representation contains exactly four 2's and three 3's.at n=19A045156
- McKay-Thompson series of class 30d for Monster.at n=34A058625
- Number of ordered 2-multiantichains on an n-set.at n=7A092880
- Semiprimes in A033951.at n=17A113691
- a(n) is the number of numbers removed in each step of Eratosthenes's sieve for 10!.at n=13A145537
- G.f.: exp( Sum_{n>=1} 2^A090740(n) * x^n/n ) where A090740(n) = highest exponent of 2 in 3^n-1.at n=23A182000
- Number of stacks of n triangles, pointing upwards or downwards depending on row parity.at n=17A224704
- The difference between the number of partitions of 2n into odd parts (A000009) and the number of partitions of 2n into even parts (A035363).at n=34A282893
- Triangle read by rows: T(1,1)=1, T(n,k) = T(n,k+1)+T(n-k,max(2*floor(k/2)-1,1)) and T(n,k) = 0 if k > A316355(n).at n=63A316354
- a(n) = Sum_{-n<i<n, -n<j<n, gcd{i,j}=3} (n-|i|)*(n-|j|)/4.at n=28A331775
- Numbers m such that the product of m and the string m in reverse contains m as a substring.at n=31A342127
- Irregular triangle read by rows: T(n,k) is the number of inequivalent connected induced k-vertex subgraphs of the hypercube graph of dimension n >= 0, 1 <= k <= 2^n.at n=42A369605