9834
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
- 4
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 21600
- Proper Divisor Sum (Aliquot Sum)
- 11766
- 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
- 2960
- Möbius Function
- 1
- Radical
- 9834
- 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
- 42
- 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
- yes
- Odd
- no
Appears in sequences
- Number of walks on square lattice.at n=5A005567
- Least term in period of continued fraction for sqrt(n) is 6.at n=40A031430
- Triangle of numbers arising in enumeration of walks on square lattice.at n=27A052175
- Triangle of numbers arising in enumeration of walks on square lattice.at n=50A052176
- a(n) = floor(a(n-1)/2) + a(n-2) with a(0)=1, a(1)=2.at n=37A064650
- Triangle T(n,k) = f(n,k,n-2), n >= 2, 1 <= k <= n-1, where f is given below.at n=48A075780
- Triangle T(n,k) = f(n,k,n-2), n >= 2, 1 <= k <= n-1, where f is given below.at n=51A075780
- Triangle T(n,k) = f(n,k,n-2), n >= 0, 0 <= k <= n, where f is given below.at n=70A075837
- Triangle T(n,k) = f(n,k,n-2), n >= 0, 0 <= k <= n, where f is given below.at n=73A075837
- Sum_{k=1..n} (k(k+1))^2/2.at n=8A086755
- G.f.: x*(1+x+x^2)*(1+6*x+8*x^2+4*x^3-x^4)/((1+x)^2*(1-x)^4).at n=17A147691
- a(n) = 9*n^2 + n.at n=32A154517
- a(n) = 1089*n^2 + 33.at n=3A158688
- Number of binary strings of length n with no substrings equal to 0000 0001 or 1111.at n=12A164416
- Numbers n for which order of Tate-Shafarevich group Ш of the elliptic curve y^2=x^3+n is 5.at n=1A179128
- Number of (n+1) X 5 0..2 arrays with every 2 X 2 subblock commuting with each of its horizontal and vertical 2 X 2 subblock neighbors.at n=5A186467
- Number of (n+1) X 7 0..2 arrays with every 2 X 2 subblock commuting with each of its horizontal and vertical 2 X 2 subblock neighbors.at n=3A186469
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=39A186472
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=41A186472
- T(n,k)=Number of (n+1)X(n+1) 0..k arrays with each 2X2 subblock off diagonal and antidiagonal nonsingular and the array of 2X2 subblock determinants antisymmetric about the diagonal and antidiagonal.at n=30A187705