12866
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22080
- Proper Divisor Sum (Aliquot Sum)
- 9214
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5508
- Möbius Function
- -1
- Radical
- 12866
- 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
- Max_{k=0..n} { Number of partitions of n into exactly k parts }.at n=48A002569
- Molien series for A_11.at n=37A008634
- Number of partitions of n into at most 11 parts.at n=37A008640
- a(n) is least k such that k and 10k are anagrams in base n (written in base 10).at n=11A023102
- a(n) = 2*(3^n) - 2^n.at n=8A027649
- Number of partitions satisfying (cn(1,5) = cn(4,5) and cn(0,5) <= cn(2,5) and cn(0,5) <= cn(3,5)).at n=50A036810
- Number of permutations of {1,2,3,...,n} where, for 1 < i <= n, the i-th number has maximized sum of the i-1 absolute differences from all previous numbers of the permutation.at n=16A095698
- Array read by antidiagonals: poly-Bernoulli numbers B(-k,n).at n=57A099594
- Array read by antidiagonals: poly-Bernoulli numbers B(-k,n).at n=63A099594
- Numbers n such that n+2*prime(n) is a perfect square.at n=34A104776
- Counts compositions as described by table A047969; however, only those ending with an odd part are considered.at n=57A123685
- Triangle T(n,k) read by rows: number of k X k triangular (0,1)-matrices with exactly n entries equal to 1 and no zero rows or columns.at n=61A137252
- a(n) = 49*n^2 - 78*n + 31.at n=16A157368
- G.f.: A(x,y) = Sum_{n>=0,m>=0} (2^m-1)^n*x^n * log(1+y)^m/m!.at n=27A163353
- Number of permutations of 1..n with i-8<=p(i)<=i+2.at n=9A179349
- Number of partitions of n containing a clique of size 2.at n=35A183559
- Base-3 Keith numbers.at n=19A188195
- Ordered differences of numbers 3^j-2^j, as in A001047.at n=35A205105
- Number of (n+1)X(n+1) 0..2 arrays with every 2X2 subblock having the same number of equal diagonal or antidiagonal elements, and new values 0..2 introduced in row major order.at n=2A205353
- Number of (n+1) X 4 0..2 arrays with every 2 X 2 subblock having the same number of equal diagonal or antidiagonal elements, and new values 0..2 introduced in row major order.at n=2A205356