12026
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20640
- Proper Divisor Sum (Aliquot Sum)
- 8614
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5148
- Möbius Function
- -1
- Radical
- 12026
- 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
- 143
- 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
- Number of centered 3-valent (or boron, or binary) trees with n nodes.at n=19A000675
- (s(n)+s(n+1))/18, where s()=A006521.at n=22A016060
- Number of ways to partition n elements into pie slices of different sizes other than one.at n=38A032155
- Numbers whose base-4 representation contains exactly four 2's and three 3's.at n=15A045156
- Numbers n such that 155*2^n-1 is prime.at n=18A050619
- The sequence 2, floor(a), floor(a^2), floor(a^3), ..., with a = 1+sqrt(5).at n=8A057146
- Numbers k such that the number of primes <= k is phi(phi(k)).at n=21A063999
- Numbers n such that for some k and a_1,a_2,...,a_k the concatenation of the a_i is equal to n and their product is equal to pi(n).at n=38A097221
- Number of partitions of n containing a clique of size 5.at n=39A183562
- Coefficient of x in the reduction by x^2->x+1 of the polynomial p(n,x) defined below in Comments.at n=19A192759
- Triangle read by rows: T(n,k) is the number of ascent sequences of length n with first occurrence of the maximal value at position k-1.at n=49A218580
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 206", based on the 5-celled von Neumann neighborhood.at n=33A270735
- a(n) is the smallest start of a run of n or more integers having a prime factor greater than n.at n=36A327909
- a(n) is the smallest start of a run of n or more integers having a prime factor greater than n.at n=37A327909
- a(n) = Sum_{k=0..floor(n/2)} (k+1) * binomial(k,3*(n-2*k)).at n=26A392254