8798
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 32
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13608
- Proper Divisor Sum (Aliquot Sum)
- 4810
- 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
- 4264
- Möbius Function
- -1
- Radical
- 8798
- 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
- 101
- 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
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers), t = (odd natural numbers).at n=28A024590
- Number of partitions satisfying cn(0,5) + cn(2,5) + cn(3,5) <= cn(1,5) + cn(4,5).at n=34A039879
- Numerator of a certain Selberg integral.at n=4A051103
- Triangle in A059037 read by rows from left to right.at n=23A059038
- Triangle in A059037 read by rows in natural order.at n=25A059039
- Sum of digits = 8 times number of digits.at n=26A061425
- Group the composite numbers so that the sum of the n-th group is a multiple of the n-th prime: (4), (6), (8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22), (24, 25), (26, 27, 28, 30, 32), (33, 34, ...), ... Sequence gives sum of n-th group.at n=22A074124
- a(n) = n^3 - n^2 - n - 1.at n=21A083074
- Number of partitions p of n such that min(p) and max(p) have a common factor.at n=46A114326
- a(n) is the number of nonnegative integers k less than 10^n such that the decimal representation of k lacks at least one of digits 1,2, at least one of digits 3,4,5 and at least one of digits 6,7,8,9.at n=3A125946
- Numbers k such that k and k^2 use only the digits 0, 4, 7, 8 and 9.at n=16A136959
- Least number k such that A070635(k) = n.at n=30A138791
- a(2*n+1) = 1+A131941(2*n+1). a(2*n) = A131941(2*n).at n=36A173809
- Numbers n for which order of Tate-Shafarevich group Ш of the elliptic curve y^2=x^3+n is 5.at n=0A179128
- Numbers n such that n!!! - 3^10 is prime, where n!3 = n!!! is a triple factorial number (A007661).at n=26A265201
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 422", based on the 5-celled von Neumann neighborhood.at n=35A272087
- Even numbers k such that A156552(k) is not a power of prime, and for which A323243(k) = sigma(A156552(k)) is congruent to 2 modulo 8.at n=28A332229
- Consider the figure made up of a row of n adjacent congruent rectangles, with diagonals of all possible rectangles drawn; a(n) is the number of interior vertices where exactly four lines cross.at n=37A336490
- Lexicographically earliest sequence of distinct positive terms such that a(n) is present in 3*a(n+1).at n=55A338942