8701
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10944
- Proper Divisor Sum (Aliquot Sum)
- 2243
- 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
- 6720
- Möbius Function
- -1
- Radical
- 8701
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 78
- 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
- no
- Odd
- yes
Appears in sequences
- Pseudoprimes to base 15.at n=17A020143
- Number of partitions of n into 9 unordered relatively prime parts.at n=37A023029
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/2n} satisfy r < s, then r < k/m < (k+4)/m < s for some integer k.at n=30A024848
- Expansion of 1/((1-2*x)*(1-6*x)*(1-10*x)*(1-11*x)).at n=3A028002
- a(n) = n*(n+1)*(2*n+1)*(n^2+n+3)/30.at n=10A061927
- Centered 20-gonal (or icosagonal) numbers.at n=29A069133
- Number of distinct lines through the origin in 3-dimensional cube of side length n.at n=21A090025
- Square array where T(n,k) = Sum_{j=0..k} C(n+2*j,j)*C(n+2*j,k-j), read by antidiagonals.at n=41A137634
- a(n) = 2*a(n-1) + 3 for n>1, a(1)=14.at n=9A156203
- a(n) = n*A007504(n)/2 = n*(sum of first n primes)/2.at n=22A156778
- a(n) equals the number of admissible pairs of subsets of {1,2,...,n} in the notation of Marzuola-Miller.at n=10A158448
- a(n) = Least i in range [A165583(n),A165583(n+1)] for which abs(A165582(i)) gets the maximum value in that range.at n=48A165584
- a(n) is the smallest term m in A173978 for which A020639(2m-3) = prime(n), n > 1.at n=29A173980
- Expansion of g.f. x^2*(1+4*x-3*x^2)/((1-x)^2*(1-2*x)*(1-3*x)).at n=8A187693
- The number of symmetric positive definite 2 X 2 matrices whose entries are integers of absolute value at most n.at n=20A219693
- Number of partitions of n where the difference between consecutive parts is at most 6.at n=34A238866
- The broken eggs problem.at n=20A256101
- Numbers n such that phi(n) = 3*phi(n-1).at n=28A266268
- a(n) = (3!)^3 * [z^3] hypergeom([], [1,1], z)^n.at n=7A287702
- Consider n equally spaced points along a line and join every pair of points by a semicircle above the line; a(n) is the number of intersection points.at n=23A290447