8608
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 17010
- Proper Divisor Sum (Aliquot Sum)
- 8402
- 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
- 4288
- Möbius Function
- 0
- Radical
- 538
- Omega Function (Ω)
- 6
- 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
- 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
- arcsinh(arcsinh(x)*sin(x))=2/2!*x^2-8/4!*x^4-40/6!*x^6+4352/8!*x^8...at n=4A012597
- Eleven iterations of Reverse and Add are needed to reach a palindrome.at n=25A015992
- Pisot sequence T(4,6), a(n) = floor(a(n-1)^2/a(n-2)).at n=28A020747
- Pisot sequence T(6,9), a(n) = floor(a(n-1)^2/a(n-2)).at n=27A020751
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 45.at n=35A031543
- Numbers which need eleven 'Reverse and Add' steps to reach a palindrome.at n=23A065216
- Numbers of partitions of 2n into n primes.at n=38A102108
- Expansion of x^2*(43 -11*x -148*x^2 +23*x^3)/(1 -2*x -7*x^2 +7*x^3 +12*x^4 -2*x^5).at n=6A121957
- a(0)=1; thereafter a(n)=a(n-1)+a([n/Phi]), where Phi=(1+sqrt(5))/2, the golden ratio.at n=36A131882
- a(n) = Sum_{d|n} phi(n/d)^2*2^(d+1).at n=12A161217
- Engel expansion of sqrt(7).at n=19A161368
- Number of ways are there to score a break of n points at snooker. Assuming an infinite number of reds are available, along with the usual six colors, and a break alternates red-color-red-...at n=28A180158
- E.g.f. A(x) = Sum_{n>=0} a(n)*x^(2*n+1)/(2*n+1)! is inverse to f(x) = 2*arctan(x) - x.at n=3A185320
- Monotonic ordering of nonnegative differences 2^i-6^j, for 40>=i>=0, j>=0.at n=43A192116
- Monotonic ordering of nonnegative differences 4^i-6^j, for 40>= i>=0, j>=0.at n=20A192163
- Number of 2 X 2 matrices having all terms in {1,...,n} and determinant >= 2n.at n=12A211062
- a(n) = 2^n mod 10000.at n=23A216095
- Number of n X 2 arrays of the minimum value of corresponding elements and their horizontal, vertical or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 n X 2 array.at n=18A219810
- E.g.f. satisfies: A(x) = 1 + A(x)^3 * Integral 1/A(x)^2 dx.at n=5A234291
- Number of (n+2)X(1+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 2 3 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 2 3 6 or 7.at n=15A252525