9098
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13650
- Proper Divisor Sum (Aliquot Sum)
- 4552
- 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
- 4548
- Möbius Function
- 1
- Radical
- 9098
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 21
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 31.at n=31A020370
- a(n) = [ a(n-1)/a(1) ] + [ a(n-2)/a(2) ] + ... + [ a(1)/a(n-1) ], for n >= 3.at n=17A022858
- Number of partitions of n with equal number of parts congruent to each of 0, 2 and 4 (mod 5).at n=52A035576
- Base-8 palindromes that start with 2.at n=32A043022
- Engel expansion of Gamma(2/3) = 1.35412.at n=9A059189
- Sum of n-th row of triangle in A082196.at n=24A082199
- Numbers that reach the fixed point 89 under iteration of f(x) = reverse(x) - maxdigit(x).at n=11A097155
- a(n+1)-+a(n)=prime, a(n+1)*a(n)=Average of twin prime pairs, a(1)=3,a(2)=10.at n=15A154496
- a(n) equals the sum of path counts in the (right-aligned Ferrers plots of) the partitions of n.at n=19A180684
- Number of nX5 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,0,1,3,4 for x=0,1,2,3,4.at n=9A195975
- The Wiener index of the graph obtained by applying Mycielski's construction to the path graph on n vertices (n>=2).at n=38A228321
- a(n) is the smallest number m such that 2*k*m - 1 is composite for all k, 0 < k < n+1.at n=28A244435
- a(n) is the smallest number m such that 2*k*m - 1 is composite for all k, 0 < k < n+1.at n=29A244435
- a(n) is the smallest number m such that 2*k*m - 1 is composite for all k, 0 < k < n+1.at n=30A244435
- a(n) is the smallest number m such that 2*k*m - 1 is composite for all k, 0 < k < n+1.at n=31A244435
- a(n) is the smallest number m such that 2*k*m - 1 is composite for all k, 0 < k < n+1.at n=32A244435
- a(n) is the smallest number m such that 2*k*m - 1 is composite for all k, 0 < k < n+1.at n=33A244435
- a(n) is the smallest number m such that 2*k*m - 1 is composite for all k, 0 < k < n+1.at n=34A244435
- a(n) is the smallest number m such that 2*k*m - 1 is composite for all k, 0 < k < n+1.at n=35A244435
- a(n) is the smallest number m such that 2*k*m - 1 is composite for all k, 0 < k < n+1.at n=36A244435