12280
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 27720
- Proper Divisor Sum (Aliquot Sum)
- 15440
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4896
- Möbius Function
- 0
- Radical
- 3070
- Omega Function (Ω)
- 5
- 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
- no
- 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
- Convolution of odd numbers and primes.at n=22A023662
- Number of partitions of n in which no parts are multiples of 25.at n=34A092885
- Let f(x)=(largest digit of x)^(smallest digit of x) + x (A097385). Sequence gives numbers n such that f(n) and f(n+1) are both prime.at n=28A097387
- sigma(n) + n is a square.at n=26A114069
- Having specified two initial terms, the "Half-Fibonacci" sequence proceeds like the Fibonacci sequence, except that the terms are halved before being added if they are even.at n=34A120424
- A higher order recursion triangle sequence: m=3;l=3;e(n,k,m)=(l*k + m - 1)e(n - 1, k, m) + (m*n - l*k + 1 - m)e(n - 1, k - 1, m).at n=34A156278
- a(n) = 3*a(n-1) - 2*a(n-2) with a(0)=16 and a(1)=40.at n=9A182461
- a(n) is the optimal wire-length for an n X n grid.at n=23A195647
- Number of primes of the form (x+1)^7 - x^7 less than 10^n.at n=31A221977
- Least number that is pandigital in some base >= n but not pandigital in bases 3 through n-1.at n=3A239437
- Number of (n+2)X(2+2) 0..1 arrays with no 3x3 subblock diagonal sum 3 and no antidiagonal sum 3 and no row sum 0 and no column sum 0.at n=5A256742
- Number of (n+2)X(6+2) 0..1 arrays with no 3x3 subblock diagonal sum 3 and no antidiagonal sum 3 and no row sum 0 and no column sum 0.at n=1A256746
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum 3 and no antidiagonal sum 3 and no row sum 0 and no column sum 0.at n=22A256748
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum 3 and no antidiagonal sum 3 and no row sum 0 and no column sum 0.at n=26A256748
- a(n) = 2*n*(16*n - 13).at n=20A263228
- Expansion of Product_{k>=1} 1/(1 - (4*k-3)*x^(4*k-3)).at n=28A265830
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 233", based on the 5-celled von Neumann neighborhood.at n=6A270977
- Number of ways to choose three distinct points from a 4 X n grid so that they form an isosceles triangle.at n=43A271913
- Number of bisymmetric and quasitrivial operations on an arbitrary n-element set.at n=7A296943
- Triangle read by rows, T(n, k) = binomial(n, k)*hypergeom([k-n, n+1], [k+2], -4), for n >= 0 and 0 <= k <= n.at n=41A297899