9680
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 30
- Divisor Sum
- 24738
- Proper Divisor Sum (Aliquot Sum)
- 15058
- 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
- 3520
- Möbius Function
- 0
- Radical
- 110
- Omega Function (Ω)
- 7
- 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
- 21
- 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
- Generalized Lucas numbers.at n=14A006491
- Expansion of log(1+sin(x))/cosh(x).at n=9A009336
- a(n) = position of 3*n^3 in A003072.at n=30A024970
- a(n) = n + (n+1)^2 + (n+2)^3.at n=19A027620
- Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 23 (most significant digit on right).at n=14A029516
- Numbers k such that 151*2^k+1 is prime.at n=11A032425
- a(n) = 5*n^2.at n=44A033429
- Four times second pentagonal numbers: a(n) = 2*n*(3*n+1).at n=40A033580
- Number of partitions in parts not of the form 23k, 23k+1 or 23k-1. Also number of partitions with no part of size 1 and differences between parts at distance 10 are greater than 1.at n=42A035989
- Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j)*11^j.at n=17A038217
- Triangle whose (i,j)-th entry is binomial(i,j)*11^(i-j)*2^j.at n=18A038316
- Numbers k such that phi(x) = k has exactly 11 solutions.at n=34A060674
- Numbers k such that sopf(k) = d(k) where d(k) = A001223(k) and sopf(k) = A008472(k).at n=24A064010
- Triangle of Gandhi polynomial coefficients.at n=19A065748
- Smallest m such that A001221(A001159(m)) = n.at n=11A066103
- Numbers from A066112 that are neither square nor twice a square, i.e., are not in A028982 but are in A028983.at n=35A066134
- Variance of time for a random walk starting at 0 to reach one of the boundaries at +n or -n for the first time.at n=11A072819
- Class numbers of fields in A085715.at n=20A085716
- Triangle read by rows: T(n,k) is the number of noncrossing connected graphs on n nodes on a circle, having exactly k four-sided faces, n>=2, 0<=k<=floor(n/2)-1.at n=23A094046
- Unsigned member r=-20 of the family of Chebyshev sequences S_r(n) defined in A092184.at n=4A099278