8810
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15876
- Proper Divisor Sum (Aliquot Sum)
- 7066
- 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
- 3520
- Möbius Function
- -1
- Radical
- 8810
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 96
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- The generalized Conway-Guy sequence w^{0}.at n=15A006754
- a(n)^2 is a square whose digits occur with an equal minimum frequency of 2.at n=37A052049
- First of triples of consecutive happy numbers, i.e., the first of three consecutive integers each of which is a happy number (A007770).at n=10A072494
- A (twin's digits) self-disappearing sequence.at n=43A108988
- Numbers k such that k*(k+7) gives the concatenation of two numbers m and m+3.at n=1A116311
- Numbers k such that k and k^2 use only the digits 0, 1, 6, 7 and 8.at n=7A136876
- 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, 0), (-1, 0, 0), (0, 1, -1), (1, -1, 1), (1, 1, 0)}.at n=8A149210
- Number of (n+1)X(n+1) -6..6 symmetric matrices with every 2X2 subblock having sum zero and two or three distinct values.at n=6A211256
- Number of (w,x,y) with all terms in {0,...,n} and x != min(|w-x|, |x-y|).at n=20A213502
- 20k^2-40k+10 interleaved with 20k^2-20k+10 for k>=0.at n=44A216875
- Number of n X 2 0..2 arrays x(i,j) with each element horizontally, vertically or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero.at n=5A230331
- Number of nX6 0..2 arrays x(i,j) with each element horizontally, vertically or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero.at n=1A230335
- T(n,k)=Number of nXk 0..2 arrays x(i,j) with each element horizontally, vertically or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero.at n=22A230337
- T(n,k)=Number of nXk 0..2 arrays x(i,j) with each element horizontally, vertically or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero.at n=26A230337
- Cardinality of the Weyl alternation set corresponding to the zero-weight in the adjoint representation of the Lie algebra of so(2n).at n=9A234598
- Numbers M(n) which are the number of terms in the sums of consecutive cubed integers equaling a squared integer, b^3 + (b+1)^3 + ... + (b+M-1)^3 = c^2, for a first term b(n) being an odd squared integer (A016754).at n=9A253707
- Numbers n for which |n/zeta(2) - Q(n)| sets a new record, where Q(x) is the number of squarefree numbers up to x.at n=28A275390
- Numbers n that have an equal number of even and odd values of A001221(k) for 1 <= k <= n.at n=10A275547
- Number of 2 X 2 matrices with all terms in {0,1,...,n} and (sum of terms) = determinant.at n=46A280588
- Numbers n such that 11^n is the highest power of 11 dividing A240751(n).at n=39A286006