2098
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3150
- Proper Divisor Sum (Aliquot Sum)
- 1052
- 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
- 1048
- Möbius Function
- 1
- Radical
- 2098
- 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
- 63
- 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 that are the sum of 12 positive 6th powers.at n=35A003368
- Erdős-Selfridge function: a(n) is the least number m > n+1 such that the least prime factor of binomial(m, n) is > n.at n=17A003458
- Numbers n such that n^32 + 1 is prime.at n=40A006315
- Number of set-like atomic species of degree n.at n=32A007650
- Coordination sequence T5 for Zeolite Code DFO.at n=35A009879
- Coordination sequence T5 for Zeolite Code VET.at n=28A009906
- Sum along upward diagonal of Pascal triangle from halfway point.at n=17A010759
- Apply partial sum operator 4 times to Fibonacci numbers.at n=10A014166
- Sum_{1<=k<n} gcd(k!,n!/k!).at n=12A014454
- Coordination sequence T1 for Zeolite Code OSI.at n=30A016430
- Least k such that b(k) = n, where b( ) is sequence A020944.at n=52A020948
- Expansion of 1/((1-x)(1-4x)(1-6x)(1-7x)).at n=3A021804
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (natural numbers >= 3), t = A023532.at n=10A024314
- T(n, 2n-9), T given by A027926.at n=8A027932
- a(n) = T(2n+1, n+2), T given by A027948.at n=5A027954
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 44.at n=12A031542
- Fractional part of square root of a(n) starts with 8: first term of runs.at n=43A034114
- Decimal part of cube root of a(n) starts with 8: first term of runs.at n=11A034134
- Number of partitions of n into parts not of form 4k+2, 12k, 12k+1 or 12k-1.at n=55A036017
- Number of partitions satisfying cn(1,5) + cn(4,5) <= 1.at n=36A039856