8884
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 15554
- Proper Divisor Sum (Aliquot Sum)
- 6670
- 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
- 4440
- Möbius Function
- 0
- Radical
- 4442
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 34
- 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 unlabeled mating digraphs with n nodes.at n=5A006023
- Molien series for 6-dimensional complex reflection group 4.U_4 (3) of order 2^9 .3^7 .5.7.at n=51A008581
- Numbers k such that the continued fraction for sqrt(k) has period 62.at n=39A020401
- Composite numbers k such that the digits of the prime factors of k are either 1 or 2.at n=41A036302
- Numbers having three 8's in base 10.at n=28A043523
- Number of partitions of n with equal number of parts congruent to each of 0, 1 and 2 (mod 3).at n=54A046765
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1 and 2 (mod 3).at n=54A046777
- Number of partitions of n with parts (with repetitions) forming a division lattice (i.e., closed under GCD and LCM).at n=59A051839
- a(n) = 4*n^2 - 7*n + 4.at n=47A054567
- Number of directed, diagonally convex polyominoes with n cells.at n=9A082398
- Start with any initial string of n numbers s(1), ..., s(n), with s(1) = 2, other s(i)'s = 2 or 3 (so there are 2^(n-1) starting strings). The rule for extending the string is this as follows: To get s(n+1), write the string s(1)s(2)...s(n) as xy^k for words x and y (where y has positive length) and k is maximized, i.e., k = the maximal number of repeating blocks at the end of the sequence. Then a(n) = number of starting strings for which k = 1.at n=15A093371
- a(n) = floor(11^n/6^n).at n=15A094989
- Indices of primes in sequence defined by A(0) = 73, A(n) = 10*A(n-1) + 33 for n > 0.at n=15A101148
- a(n) = Sum_{k=1..n} floor(n^2/k).at n=45A118014
- Number of degenerate Berge perfect graphs on n nodes.at n=7A123419
- Triangle, read by rows, where row n equals the inverse binomial transform of column n in the rectangular table A124460.at n=38A124469
- 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, -1, -1), (-1, -1, 0), (-1, -1, 1), (-1, 0, 1), (1, 1, 0)}.at n=9A149089
- Least happy number with next happy number of distance n.at n=24A193573
- Number of 2 X 2 matrices having all elements in {-n,...,n} and determinant 1.at n=30A209982
- A122536(2n)/2.at n=7A211975