9822
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19656
- Proper Divisor Sum (Aliquot Sum)
- 9834
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3272
- Möbius Function
- -1
- Radical
- 9822
- Omega Function (Ω)
- 3
- 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
- 122
- 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 nontrivial Baxter permutations of length 2n-1.at n=7A001183
- Composite binary rooted trees with external nodes.at n=18A035102
- Smallest value of x such that M(x) = -n, where M(x) is Mertens's function A002321.at n=36A051401
- Inverse Mertens function: smallest k such that |M(k)| = n, where M(x) is Mertens's function A002321.at n=36A051402
- An inverse to Mertens's function: smallest k >= 2 such that Mertens's function |M(k)| (see A002321) is equal to n.at n=37A060434
- Numbers k such that 2^k + k^3 + 1 is prime.at n=16A100358
- Expansion of x/( 1+x-x^2-x^4-x^5-x^6-x^7+x^9+x^10 ).at n=18A142155
- a(n) = IntegerPart(PolyGamma(n, 2)).at n=10A144168
- a(n) is the smallest integer k such that the n-th (backward) difference of the partition sequence A000041 is positive from k onwards.at n=25A155861
- Numbers k for which A064380(k) = k/2.at n=8A185078
- Number of (w,x,y,z) with all terms in {1,...,n} and 2w+2x=3y+3z.at n=36A212567
- Number of n X n 0..1 arrays with rows and antidiagonals unimodal.at n=3A223675
- Number of nX4 0..1 arrays with rows and antidiagonals unimodal.at n=3A223676
- T(n,k)=Number of nXk 0..1 arrays with rows and antidiagonals unimodal.at n=24A223680
- Number of 4 X n 0..1 arrays with rows and antidiagonals unimodal.at n=3A223682
- Triangle T(n, k) = T(n, k-1) + (-1)^k*A060187(n+2,k+1) if k <= floor(n/2), otherwise T(n, n-k), with T(n, 0) = T(n, n) = 1, read by rows.at n=17A225356
- Triangle T(n, k) = T(n, k-1) + (-1)^k*A060187(n+2,k+1) if k <= floor(n/2), otherwise T(n, n-k), with T(n, 0) = T(n, n) = 1, read by rows.at n=18A225356
- Smallest sets of 6 consecutive abundant numbers in arithmetic progression. The initial abundant number is listed.at n=19A228963
- Number of (n+1)X(1+1) 0..4 arrays with row and column sums nondecreasing, and no adjacent elements equal.at n=3A233309
- T(n,k)=Number of (n+1)X(k+1) 0..4 arrays with row and column sums nondecreasing, and no adjacent elements equal.at n=6A233311