9835
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13536
- Proper Divisor Sum (Aliquot Sum)
- 3701
- 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
- 6720
- Möbius Function
- -1
- Radical
- 9835
- 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
- 166
- 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
- no
- Odd
- yes
Appears in sequences
- A015938(n)-2^n.at n=50A015939
- Every run of digits of n in base 6 has length 2.at n=41A033004
- Numbers k such that k divides the numerator of B(2k) (the Bernoulli numbers), but gcd(3k, 8^k+1) > 3.at n=22A070192
- Row sums of the triangle in A122820.at n=34A077388
- Positions of 9 in partition of decimal expansion of Pi A104807.at n=34A104809
- Numbers n such that n^2-6 and n^2+6 are both prime.at n=40A108403
- Number of base-2 strong pseudoprimes (A001262) less than 2^n.at n=36A108797
- Start with 1 and repeatedly reverse the digits and add 56 to get the next term.at n=21A118152
- Start with 1057 and repeatedly reverse the digits and add 2 to get the next term.at n=33A120215
- Smallest sum of n consecutive odd primes which is a multiple of n.at n=34A132810
- a(n) = n*(8*n+1).at n=35A139275
- Number of reduced words of length n in the Weyl group B_7.at n=13A161716
- Number of reduced words of length n in the Weyl group B_7.at n=36A161716
- Triangular array read by rows. T(n,k) is the number of partial functions on {1,2,...,n} that are endofunctions with no cycles of length > 1 that have exactly k components.at n=32A203092
- Number of 5-bead necklaces labeled with numbers -n..n not allowing reversal, with sum zero and avoiding the patterns z z+1 z+2 and z z-1 z-2.at n=7A209117
- Values of n such that L(6) and N(6) are both prime, where L(k) = (n^2+n+1)*2^(2*k) + (2*n+1)*2^k + 1, N(k) = (n^2+n+1)*2^k + n.at n=49A226926
- Alternating sum of heptagonal pyramidal numbers.at n=28A269428
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 350", based on the 5-celled von Neumann neighborhood.at n=29A271303
- Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 30", based on the 5-celled von Neumann neighborhood.at n=14A274487
- Number T(n,k) of set partitions of [n], where k is minimal such that for all j in [n]: j is member of block b implies b = 1 or at least one of j-1, ..., j-k is member of a block >= b-1; triangle T(n,k), n >= 0, 0 <= k <= max(floor(n/2), n-2), read by rows.at n=43A287640