12890
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23220
- Proper Divisor Sum (Aliquot Sum)
- 10330
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5152
- Möbius Function
- -1
- Radical
- 12890
- 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
- 24
- 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
- a(n) = Sum_{k=0..n} (k+1) * A026769(n, k).at n=10A027243
- Numbers k such that 30*R_k + 7 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=16A056680
- Repeated integer partitions or nested integer partitions.at n=11A131408
- Arithmetic mean of primes on square intervals such that the mean is an integer.at n=19A161348
- Convolution of the Floor-Sqrt transform of central binomial coefficients.at n=12A192657
- Highest scoring cribbage hand with n cards.at n=17A195676
- Number of 0..5 arrays x(0..n+1) of n+2 elements without any interior element greater than both neighbors or less than both neighbors.at n=4A200868
- T(n,k)=Number of 0..k arrays x(0..n+1) of n+2 elements without any interior element greater than both neighbors or less than both neighbors.at n=40A200871
- Number of 0..n arrays x(0..6) of 7 elements without any interior element greater than both neighbors or less than both neighbors.at n=4A200875
- Numbers n such that m + (sum of digits in base-3 representation of m) = n has exactly four solutions.at n=45A230856
- Number of partitions of n such that (number parts having multiplicity 1) is not a part and (number of 1s) is not a part.at n=42A241509
- Number of free 4-dimensional polyhypercubes with n cells, allowing edge- and face-connections.at n=4A365358
- Irregular triangle read by rows: T(n,k) (0 <= k <= n^2) are coefficients of cluster density function for site percolation on an n X n 2D nnsquare lattice with periodic boundary conditions.at n=25A365942
- Total number of firings in a certain chip-firing game that starts with 2^n chips and is described in the comments.at n=9A389565