8891
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
- 9432
- Proper Divisor Sum (Aliquot Sum)
- 541
- 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
- 8352
- Möbius Function
- 1
- Radical
- 8891
- 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
- 70
- 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
- Number of ways in which n identical balls can be distributed among 7 boxes in a row such that each pair of adjacent boxes contains at least 4 balls.at n=7A005340
- Numbers whose base-4 representation contains exactly four 2's and two 3's.at n=31A045155
- Number of inequivalent (ordered) solutions to n^2 = sum of 7 squares of integers >= 0.at n=44A065461
- a(n) = 6*n*(n-1) - 1.at n=39A103115
- Related to enumeration of rooted catapolyoctagons (see Cyvin reference for precise definition).at n=11A121119
- Number of ways, counted up to symmetry, to build a contiguous building with n LEGO blocks of size 1 X 2 which is flat, i.e., with all blocks in parallel position and symmetric after a rotation by 180 degrees.at n=13A123765
- Record values in A132601.at n=45A132603
- Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 110-111-111 pattern in any orientation.at n=13A146276
- Multiples of 17 whose reversal + 1 is also a multiple of 17.at n=27A166391
- Numbers that are the product of two distinct primes and they are partial sum of products of two distinct primes.at n=24A168476
- Coefficient of x in the reduction by x^2->x+1 of the polynomial p(n,x) defined below in Comments.at n=14A192755
- a(n) = Sum_{i=0..n} digsum_6(i)^4, where digsum_6(i) = A053827(i).at n=20A231675
- Number of (2+1) X (n+1) 0..1 arrays with every 2 X 2 subblock ne-sw antidiagonal difference nondecreasing horizontally and nw+se diagonal sum nondecreasing vertically.at n=21A258555
- Semiprimes that are the sum of the first n odd primes for some n.at n=21A274182
- Expansion of Product_{k>=1} ((1 - x^(7*(2*k-1))) * (1 - x^(7*k)) / (1 - x^k)).at n=36A280937
- Number of nX5 0..1 arrays with every element equal to 2, 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=7A298892
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 2, 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=70A298895
- Number of solutions to x^2 + y^2 + z^2 + w^2 <= n^2, where x, y, z, w are positive odd integers.at n=26A349611
- Numbers with easy multiplication table - the first 9 multiples of these numbers can be derived by either incrementing or decrementing the corresponding digits from the previous multiple.at n=16A359925
- Numbers k such that 3*k and 7*k share the same set of digits.at n=32A362792