9736
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18270
- Proper Divisor Sum (Aliquot Sum)
- 8534
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4864
- Möbius Function
- 0
- Radical
- 2434
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 2
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
- 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
- a(n) = T(2n-1,n), where T is the array defined in A026082.at n=6A026088
- Trajectory of 3 under map n->15n+1 if n odd, n->n/2 if n even.at n=8A037105
- Number of factorizations into distinct factors with 2 levels of parentheses indexed by prime signatures. A050347(A025487).at n=44A050348
- Numbers n such that n and 2^n end with the same three digits.at n=9A067866
- Interprimes which are of the form s*prime, s=8.at n=18A075283
- First occurrence of n as a term in the continued fraction for sqrt(Pi).at n=49A076589
- Number of matched parentheses and brackets of length n, where a closing bracket will close any remaining open parentheses back to the matching open bracket (as in some versions of LISP).at n=11A078623
- Matrix product of unsigned Stirling1-triangle |A008275(n,k)| and Stirling1-triangle A008275(n,k).at n=36A079642
- Expansion of e.g.f. log(1-log(1-x)).at n=9A089064
- Number of unordered collections of distinct nonempty subsets of an n-element set where each element appears in at most 2 subsets.at n=5A178165
- Number of strings of numbers x(i=1..n) in 0..2 with sum i^2*x(i)^3 equal to n^2*8.at n=16A184311
- Number of partitions of n such that m(greatest part) < m(1), where m = multiplicity.at n=35A240076
- Number of partitions of n with difference 4 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=37A242695
- Concatenation of n-th prime and n-th nonprime.at n=24A253910
- a(n) = A001235(n) - floor(A001235(n)^(1/3))^3.at n=43A273555
- Numbers that are the largest value in the Collatz (3x+1) trajectories of exactly six initial values.at n=37A274467
- Number of (not necessarily maximal) cliques in the n X n king graph.at n=31A295906
- Square array A(n,k), n >= 1, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f. log(1 + Sum_{j>=1} binomial(j+k-1,k) * x^j/j).at n=44A308497
- Numbers k such that 301*2^k+1 is prime.at n=8A322915
- T(n, k) = [x^k] Sum_{k=0..n} |Stirling1(n, k)|*FallingFactorial(x, k), triangle read by rows, for n >= 0 and 0 <= k <= n.at n=46A325873