9740
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 20496
- Proper Divisor Sum (Aliquot Sum)
- 10756
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3888
- Möbius Function
- 0
- Radical
- 4870
- Omega Function (Ω)
- 4
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 135
- 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
- Coordination sequence for MgCu2, Cu position.at n=25A009930
- Seventh column of triangle A055252.at n=6A055583
- Antidiagonal sums of square table A086626.at n=9A086628
- Number of isomorphism classes of simple quadrangulations of the sphere having n vertices and n-2 faces, minimal degree 3, with orientation-reversing isomorphisms forbidden.at n=12A113203
- Triangle read by rows: T(n,k) is the number of nondecreasing Dyck paths of semilength n, having k distinct valley levels (n>=1, k>=0).at n=44A121463
- a(n) = tau(n) * (NumberOfPartitions(n) - 1).at n=26A141668
- a(n) = 250*n - 10.at n=38A154378
- Partial sums of prime numbers of measurement A002049.at n=29A173702
- Parameters k for which the Tate-Shafarevich group Ш of the elliptic curve y^2=x^3-k has order 36.at n=6A179138
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2 + (x+487)^2 = y^2.at n=6A207076
- Number of 2 X 2 matrices with all terms in {0,1,...,n} and (sum of terms) = n + 5.at n=32A210377
- Number of length-4 0..n arrays with no repeated value differing from the previous repeated value by other than plus or minus one modulo n+1.at n=8A269679
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 1", based on the 5-celled von Neumann neighborhood.at n=23A269908
- Numbers k such that (68*10^k + 7)/3 is prime.at n=26A270613
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 526", based on the 5-celled von Neumann neighborhood.at n=31A272744
- T(n, k) = binomial(2*n - k, k - 1)*hypergeom([2, 2, 1 - k], [1, 2*(1 - k + n)], -1), triangle read by rows, T(n,k) for n >= 0 and 0 <= k <= n.at n=52A320906
- Number of maximal primitive subsets of {1..n}.at n=44A326077
- T(n, k) = [x^(n-k)] 1/(((1 - 2*x)^k)*(1 - x)^(k + 1)). Triangle read by rows, for 0 <= k <= n.at n=48A331969
- a(n) is the smallest number k such that Sum_{j=1..k} (-1)^omega(j) = -n, where omega(j) is the number of distinct primes dividing j.at n=33A346456
- Row sums of A364891.at n=39A364892