9735
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 17280
- Proper Divisor Sum (Aliquot Sum)
- 7545
- 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
- 4640
- Möbius Function
- 1
- Radical
- 9735
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 47
- Smith Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Number of 4-colorings of cyclic group of order n.at n=12A007687
- a(n) = n*(9*n-2).at n=33A013656
- a(n) = (d(n)-r(n))/2, where d = A026063 and r is the periodic sequence with fundamental period (1,1,0,1).at n=38A026064
- Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1<x<y<z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791), and increasing values of y in case of ties. Sequence gives values of y.at n=15A050793
- Numbers k such that (7*3^k + 5)/2 is prime.at n=14A059528
- Number of permutations of [n] with exactly 2 descents which avoid the pattern 1324.at n=10A098992
- Where records occur in A111390.at n=45A114111
- (n^4 - 10*n^2 + 15*n - 6)/2.at n=11A135916
- a(n) = (prime(n)^2 + prime(n+1))/2.at n=32A140511
- Odd squarefree numbers n such that the cyclotomic polynomial Phi(n,x) has height 5.at n=26A152943
- G.f. satisfies: A(x) = Sum_{n>=0} A_n(x) * A(x)^n where A_{n+1}(x) = A_n(A(x)) denotes iteration with A_0(x)=x and A'(0)=1.at n=7A180256
- Number of nX3 0..3 arrays with every row and column nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=15A201446
- Number of (n+2)X1 0..2 arrays with all rows having a nonnegative second derivative, and all columns having a positive second derivative in a quadratic least squares fit, with one and two element arrays taken as having a zero second derivative.at n=6A223388
- T(n,k) is the number of (n+2) X k 0..2 arrays with all rows having a nonnegative second derivative, and all columns having a positive second derivative in a quadratic least squares fit, with one and two element arrays taken as having a zero second derivative.at n=27A223391
- Number of second differences of arrays of length 4 of numbers in 0..n.at n=30A228219
- Number of partitions p of n such that if h = min(p), then h is an (h,2)-separator of p; see Comments.at n=50A239729
- a(n) = 10*n^2 + 4*n + 1.at n=31A272039
- Expansion of Product_{k>=1} (1 + x^(4*k))^(4*k) / (1 + x^k)^k.at n=28A285295
- Unique terms in sequence A294640, in order by size.at n=61A294641
- Number of n element multisets of the 15th roots of unity with zero sum.at n=41A321418