8885
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10668
- Proper Divisor Sum (Aliquot Sum)
- 1783
- 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
- 7104
- Möbius Function
- 1
- Radical
- 8885
- 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
- 34
- 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 genus 0 rooted planar maps with 4 faces and n vertices.at n=3A000365
- Number of rooted planar maps with n edges.at n=6A006294
- Expansion of Product_{m>=1} (1+x^m)^5.at n=11A022570
- a(n) = (binomial(4*n, 2*n) + binomial(2*n, n)^2)/2.at n=4A036910
- a(n) = (binomial(4*n, 2*n) + (-1)^n*binomial(2*n, n)^2)/2.at n=4A036911
- Numbers having three 8's in base 10.at n=29A043523
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 9.at n=14A051974
- Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives i values.at n=37A053719
- Numbers k such that 7*10^k + 6*R_k - 3 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=15A103064
- Near-repdigit semiprimes with 8 as repeated digit.at n=9A105989
- Numbers k such that k concatenated with k-3 gives the product of two numbers which differ by 9.at n=2A116140
- Numbers k such that k concatenated with k+5 gives the product of two numbers which differ by 7.at n=1A116195
- a(1)=a(2)=1; a(n) = a(n-2) + a(n-1) + (number of terms from among {a(1), a(2), ..., a(n-1)} which are prime).at n=18A128609
- Number of hierarchical ordered partitions of partitions.at n=12A141199
- Numbers k such that the continued fraction of (1 + sqrt(k))/2 has period 9.at n=45A143577
- Numbers such that n^2 = 29 mod 1193.at n=14A165989
- Continued fraction expansion for exp( Sum_{n>=1} 1/(n*A085447(n)) ), where A085447(n) = (3+sqrt(10))^n + (3-sqrt(10))^n.at n=7A174507
- Let f(m) = number of steps needed to reach a Harshad number when the map k->A062028(l) is iterated starting at m; a(n) = smallest m such that f(m) = n.at n=62A181664
- Number of (n+4) X 9 0..1 matrices with each 5 X 5 subblock idempotent.at n=10A224687
- Minimum value unattainable as the sum of 6 attained values of i^2 with i in 0..n.at n=41A225279