9833
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
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 9834
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 9832
- Möbius Function
- -1
- Radical
- 9833
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 47
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1213
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Least term in period of continued fraction for sqrt(n) is 5.at n=32A031429
- Numbers whose base-4 representation contains exactly three 1's and four 2's.at n=21A045104
- Smallest value of x such that M(x) = -n, where M(x) is Mertens's function A002321.at n=40A051401
- Inverse Mertens function: smallest k such that |M(k)| = n, where M(x) is Mertens's function A002321.at n=40A051402
- Primes p such that there is no Carmichael number pqr, p<q<r q, r primes.at n=8A051663
- Number of compositions of n into nonprime numbers.at n=24A052284
- An inverse to Mertens's function: smallest k >= 2 such that Mertens's function |M(k)| (see A002321) is equal to n.at n=41A060434
- a(n) = ceiling(a(n-1)/2) + a(n-2) with a(0)=0 and a(1)=1.at n=37A064651
- G.f.: (1-x+2*x^2+2*x^3+2*x^4-x^5+x^6)/((1-x)*(1-x^2)^2*(1-x^3)).at n=48A083709
- Smallest prime of the form 10^k - prime(n), or 0 if no such prime exists.at n=38A090289
- Square array T(n,k), read by antidiagonals: number of labeled trees, with increments of labels along edges constrained to -1,0,1, with n nodes that have no label greater than k.at n=33A101486
- Smallest of five consecutive primes whose sum of digits is prime.at n=26A106718
- The set of primes of the form 4n+1 that is minimal in the sense of A071062.at n=48A111055
- Numbers k such that 2^k + 3^k + 5^k + 7^k is a prime number.at n=5A114301
- Primes p such that q = 4p^2 + 1 and r = 4q^2 + 1 are also prime.at n=19A122424
- Primes p such that q = 4p^2 + 1, r = 4q^2 + 1 and s = 4r^2 + 1 are all primes.at n=1A122429
- Where records occur in A127913.at n=32A129415
- Array T(k,n) = n-th prime p such that 2^2^k + p^2^k is prime, k>2, read by antidiagonals.at n=50A132260
- Prime sequence overlaying the central digits of prime numbers. If possible, the value is greater than the previous one. Zero if no such embedding is possible.at n=22A133781
- Numbers k such that k and k^2 use only the digits 3, 6, 7, 8 and 9.at n=16A137137