9983
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10200
- Proper Divisor Sum (Aliquot Sum)
- 217
- 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
- 9768
- Möbius Function
- 1
- Radical
- 9983
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 166
- 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
- Decimal concatenation of n-th lucky number and n-th prime number.at n=22A032604
- Numbers whose base-4 representation contains exactly two 2's and four 3's.at n=35A045147
- Composite numbers k for which phi(k) + sigma(k) is an integer multiple of the 4th power of the number of divisors of k.at n=39A055468
- Numbers x such that sigma(x)-x divides x-1, other than prime powers.at n=6A059047
- Numbers k such that k, k+2, k+4, k+6, k+8, k+10, k+12 and k+14 are semiprimes.at n=1A082919
- Numbers k such that k, k+2, k+4, k+6, k+8 are semiprimes.at n=29A092127
- Numbers k such that k, k+2, k+4, k+6, k+8, k+10 are semiprimes.at n=8A092128
- Numbers k such that k, k+2, k+4, k+6, k+8, k+10, k+12 are semiprimes.at n=3A092129
- Duplicate of A082919.at n=1A092208
- Number of fuzzy subgroups of rank 3 cyclic group of order (p^n)*q*r where p, q and r are three distinct prime.at n=6A107464
- Riordan array (1/(1 - x*c(x) - x^2*c(x)^2), x*c(x)) where c(x) is the g.f. of A000108.at n=58A109267
- Composite numbers between largest n-digit prime and the smallest (n+1) digit prime.at n=26A109936
- A sequence of asymptotic density zeta(9) - 1, where zeta is the Riemann zeta function.at n=19A143035
- A144325(n) + A144313(n) + A144315(n).at n=23A144715
- a(n) = 256*n - 1.at n=38A158250
- Triangle of coefficients of polynomials v(n,x) jointly generated with A210549; see the Formula section.at n=63A210550
- Numbers n such that n+2, n+4, n+6, n+8, n+10, n+12 and n+14 are all semiprimes.at n=4A268578
- Composite numbers whose sum of aliquot parts divide the sum of the squares of their aliquot parts.at n=30A301482
- G.f.: Sum_{k>=1} x^k/(1-x^k) * Product_{k>=1} (1+x^k).at n=35A305082
- For 1<=x<=n, 1<=y<=n, write gcd(x,y) = u*x+v*y with u,v minimal; a(n) = sum of the values of |u|.at n=46A345432