9808
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 19034
- Proper Divisor Sum (Aliquot Sum)
- 9226
- 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
- 4896
- Möbius Function
- 0
- Radical
- 1226
- Omega Function (Ω)
- 5
- 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
- 42
- 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
- Number of certain rooted planar maps.at n=6A000259
- a(n) = floor( n*(n-1)*(n-2)*(n-3)/26 ).at n=24A011936
- Pseudoprimes to base 65.at n=36A020193
- Integers n > 1997 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 1997.at n=25A063055
- Expansion of e.g.f. 1/(1+2*log(1-x)).at n=5A088500
- Natural numbers written out with their digits grouped in sets of four (leading zeros omitted).at n=37A091332
- Alkane systems (see Cyvin reference for precise definition).at n=6A121185
- Number of partitions of n into parts that are odd or == +- 2 (mod 10).at n=41A133153
- Coefficients of the second order mock theta function B(q).at n=32A153140
- Number of n X 3 1..3 arrays containing at least one of each value, all equal values connected, and rows considered as a single number in nondecreasing order.at n=5A166782
- Regular triangle, T(n, k) = f(n, k) - f(n, 0) + 1, where f(n, k) = Sum_{j=0..k} StirlingS1(n, n-j)*binomial(n,j) + Sum_{j=0..n-k} StirlingS1(n, n-j)*binomial(n, j), read by rows.at n=31A176155
- Regular triangle, T(n, k) = f(n, k) - f(n, 0) + 1, where f(n, k) = Sum_{j=0..k} StirlingS1(n, n-j)*binomial(n,j) + Sum_{j=0..n-k} StirlingS1(n, n-j)*binomial(n, j), read by rows.at n=32A176155
- Number of distinct solutions of sum{i=1..2}(x(2i-1)*x(2i)) = 1 (mod n), with x() only in 1..n-1.at n=47A180784
- Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and w^2>x^2+y^2.at n=17A211631
- Numbers k such that k^3 + 3*k + 3^k is prime.at n=19A220701
- Number of n X 4 0..1 arrays with rows, columns, diagonals and antidiagonals unimodal.at n=4A223640
- Number of nX5 0..1 arrays with rows, columns, diagonals and antidiagonals unimodal.at n=3A223641
- T(n,k)=Number of nXk 0..1 arrays with rows, columns, diagonals and antidiagonals unimodal.at n=32A223644
- T(n,k)=Number of nXk 0..1 arrays with rows, columns, diagonals and antidiagonals unimodal.at n=31A223644
- Irregular triangle read by rows: T(n,k) is the number of binary pattern classes in the (4,n)-rectangular grid with k '1's and (4n-k) '0's: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=51A225812