9683
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10128
- Proper Divisor Sum (Aliquot Sum)
- 445
- 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
- 9240
- Möbius Function
- 1
- Radical
- 9683
- Omega Function (Ω)
- 2
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 104
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Expansion of e.g.f. log(cosh(x)-log(x+1)).at n=8A013497
- a(n) = C(n+3,4) + 3*C(n+1,3) + 5*C(n-1,2) + 7*n - 15.at n=16A034858
- a(n) = C(n+3,4) + 3*C(n+1,3) + 5*C(n-1,2) + 7*n - 15 for n >= 3; a(1)=1, a(2)=10.at n=17A034859
- a(1) = 4; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=44A074341
- Indices of primes of the form k^2 - 11.at n=42A091273
- Absolute value of difference between counts of uninterrupted runs of 3 nonprimes in A093187 and A093188.at n=10A093399
- Number of 5k+3 primes (A030431) in range ]2^n,2^(n+1)].at n=18A095023
- Numbers n such that sigma(n) - phi(n) is a repdigit greater than 2.at n=36A116020
- Start with 1015 and repeatedly reverse the digits and add 4 to get the next term.at n=34A117807
- Convolution square of A003114.at n=34A145467
- a(n) = 20*n^2 + 3.at n=21A167573
- Monotonic ordering of nonnegative differences 3^i-10^j, for 40>= i>=0, j>=0.at n=21A192159
- 3^n mod 10000.at n=9A216097
- Number of 2 X n arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 2 X n array.at n=42A220154
- Coefficients of the generalized continued fraction expansion of twice the Euler constant, 2*gamma = a(1) +a(1)/(a(2) +a(2)/(a(3) +a(3)/(a(4) +a(4)/....))).at n=9A233586
- Exponents m such that the decimal expansion of 6^m exhibits its first zero from the right later than any previous exponent.at n=19A239011
- Solution of the complementary equation a(n) = 2*a(n-1) - b(n-1), where a(0) = 3, a(1) = 5, b(0) = 1, and (a(n)) and (b(n)) are increasing complementary sequences.at n=14A295058
- Records in A095258.at n=14A350741
- Convolution of A000041 and A000290.at n=15A360486
- a(n) = Sum_{k=1..n} (-1)^(k-1) * binomial(floor(n/k)+2,3).at n=38A366395