8198
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12300
- Proper Divisor Sum (Aliquot Sum)
- 4102
- 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
- 4098
- Möbius Function
- 1
- Radical
- 8198
- 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
- 158
- 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 10 positive 11th powers.at n=4A004821
- Numbers that are the sum of at most 11 positive 11th powers.at n=48A004917
- Numbers k such that the continued fraction for sqrt(k) has period 70.at n=29A020409
- Expansion of Product_{m>=1} (1+x^m)^2.at n=27A022567
- 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 90.at n=7A031588
- Numbers whose base-4 representation contains exactly four 0's and two 2's.at n=20A045059
- a(n) = (1/2)*A050871 (row sums of array T in A050870, periodic binary words).at n=14A050872
- Least integer m whose largest prime factor > m^(n/(n+1)).at n=11A063765
- Engel expansion of log(23).at n=11A067923
- Indices of primes of the form k^2 - 11.at n=38A091273
- Total number of subsets of the n-th roots of 1 that add to zero.at n=39A103314
- Numbers k such that the first 9 decimal digits of the k-th Fibonacci number is 1-9 pandigital.at n=4A112516
- Expansion of (1-x)/(1-3x+x^2+4x^3-4x^4).at n=13A117353
- A106486-encodings for the minimal representatives of each equivalence class of the finite combinatorial games.at n=39A126011
- Numbers which are the sum of three cubes of distinct primes.at n=40A138854
- Counts of unique periodic binary strings of length n.at n=39A152061
- a(n) = 2^n + 6.at n=13A153972
- Triangle read by rows in which row n lists n+1 terms, starting with n, such that the difference between successive terms is equal to n^4 - 1.at n=38A162622
- Triangle read by rows in which row n lists n terms, starting with n, such that the difference between successive terms is equal to n^4 - 1 = A123865(n).at n=30A162623
- Triangle read by rows in which row n lists n terms, starting with n^4 + n - 1, such that the difference between successive terms is equal to n^4 - 1 = A123865(n).at n=29A162624