8844
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 22848
- Proper Divisor Sum (Aliquot Sum)
- 14004
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2640
- Möbius Function
- 0
- Radical
- 4422
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 96
- 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 irreducible alternating Euler sums of depth 6 and weight 6+2n.at n=19A011796
- a(n) = floor( n*(n-1)*(n-2)/11 ).at n=47A011893
- Poincaré series [or Poincare series] for depths of roots in a certain root system.at n=11A019525
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 23 (most significant digit on right and removing all least significant zeros before concatenation).at n=8A029540
- a(n) = 4*n*(2*n + 1).at n=33A033586
- Number of partitions of n with equal number of parts congruent to each of 0, 2 and 3 (mod 5).at n=53A035575
- Number of mirror-symmetrical edge-rooted tree-like octagonal systems.at n=11A036759
- Star of David matchstick numbers: a(n) = 6*n*(3*n+1).at n=22A045946
- Indices of octagonal numbers which are also pentagonal.at n=3A046188
- Distinct numbers in writing first numerator and then denominator of each element of the 1/5-Pascal triangle (by row).at n=47A046608
- First numerator and then denominator of the central elements of the 1/5-Pascal triangle (by row).at n=14A046610
- First denominator and then numerator of the central elements of the 1/5-Pascal triangle (by row).at n=15A046611
- Distinct numbers in writing first numerator and then denominator of the central elements of the 1/5-Pascal triangle (by row).at n=7A046612
- Even numbers in the numerators of the 1/5-Pascal triangle (by row).at n=40A046625
- Distinct even numbers in the numerators of the 1/5-Pascal triangle (by row).at n=21A046626
- a(n) = C(n)*(11n+1) where C(n) = Catalan numbers (A000108).at n=6A050490
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 7 skipped primes.at n=44A050774
- Partial sums of A050406.at n=6A052254
- Digits composite, each digit minus 1 is prime, sum of digits minus 1 is prime, difference of digits (in absolute value) minus 1 is prime.at n=43A058229
- Stirling interpolation of f'(x) by (2n+1)-st differences.at n=11A061027