8843
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9120
- Proper Divisor Sum (Aliquot Sum)
- 277
- 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
- 8568
- Möbius Function
- 1
- Radical
- 8843
- 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
- 78
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = a(n-1) + 3*a(n-2).at n=11A006138
- Number of factorization patterns of polynomials of degree n over F_2.at n=24A006167
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly seven 1's.at n=42A020443
- Positions where number of periodic partitions increases.at n=35A059994
- Total number of square parts in all partitions of n.at n=25A073336
- Numbers k for which the sums of prime factors (ignoring multiplicity) of sigma(k) and phi(k) are equal but the sets of prime factors of sigma and phi are different.at n=34A081378
- Number of partitions of n such that all parts, with the possible exception of the smallest, appear only once.at n=43A115029
- a(n) = n_{n^2}.at n=46A122625
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 0), (0, 0, 1), (0, 1, -1), (1, 0, -1)}.at n=9A148676
- a(n) = Floor(Fibonacci(n)^(1/Pi)).at n=61A171962
- a(n) = n*(13*n-3)/2.at n=37A186030
- a(n) = (prime(n) - 1)*(prime(n+1) - 1)/2 + 3.at n=31A201498
- Minimum value unattainable as the sum of 2 attained values of a*b*c with a,b,c 0..n integers.at n=20A225264
- T(n,k)=Number of length n+2 0..k arrays with the sum of second differences multiplied by some arrangement of +-1 equal to zero.at n=47A250561
- Number of length 3+2 0..n arrays with the sum of second differences multiplied by some arrangement of +-1 equal to zero.at n=7A250562
- Triangle read by rows: T(n,m) = Sum_{i=0..n+1} C(n-i+1,i-1)*C(n-i+1,i)*C(n-i+1,m-i+1).at n=53A298309
- Number of prime parts in the partitions of n into 7 parts.at n=40A309436
- a(n) is the upper end of a record gap A349995(n) between consecutive odd squarefree semiprimes (A046388).at n=6A350099
- a(n) is the number of 132-avoiding permutations p so that p^3 is the identity permutation.at n=16A370686
- Number of non-biquanimous subsets of {1..n} containing n.at n=14A371793