8842
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13266
- Proper Divisor Sum (Aliquot Sum)
- 4424
- 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
- 4420
- Möbius Function
- 1
- Radical
- 8842
- 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
- 96
- 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 67.at n=11A020406
- a(n) = floor(binomial(2*n,n)/3^n).at n=40A024503
- a(n) = 2nd elementary symmetric function of C(n,0), C(n,1), ..., C(n,[ n/2 ]).at n=6A025136
- Base 8 digits are, in order, the first n terms of the periodic sequence with initial period 2,1.at n=4A037493
- Base-8 palindromes that start with 2.at n=28A043022
- Let R(i,j) be the rectangle with antidiagonals 1; 2,3; 4,5,6; ...; the n-th Fibonacci number is in antidiagonal a(n).at n=37A057042
- The n-th highly composite number equals the a(n)-th composite number, for n >= 3.at n=20A074329
- Shifts one place left under 7th-order binomial transform.at n=5A075506
- A106486-encodings of combinatorial games with value -1.at n=23A125993
- a(n) = n^3 - 4*n^2 + 6*n - 2.at n=19A188377
- Numbers n such that 2^n'-1 is prime, where n' is the arithmetic derivative of n.at n=16A189992
- Number of 0..n arrays x(0..5) of 6 elements with nondecreasing average value and 0..n occur with instance counts within one of each other.at n=9A200945
- Composite numbers whose concatenation of their aliquot parts, in ascending order, is a palindrome.at n=25A249300
- Composite numbers n such that Sum_{k = 0..n} (-1)^k * C(n,k) * C(2*n,k) == -1 (mod n^3) (see A234839).at n=18A268303
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 414", based on the 5-celled von Neumann neighborhood.at n=27A272014
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 324", based on the 5-celled von Neumann neighborhood.at n=13A281104
- Rectangular table of coefficients T(k,n) in row functions R(k,x) = Sum_{n>=0} T(k,n)*x^n that satisfy the condition: Sum_{n>=0} x^n/(1 - x*R(k,x)^(n+k)) = Sum_{n>=0} x^n*R(k,x)^n/(1 - x*R(k,x)^(k*n+k-1)), for k >= 0, read here by antidiagonals.at n=43A340940
- Row k = 1 of rectangular table A340940.at n=7A340942