8601
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11904
- Proper Divisor Sum (Aliquot Sum)
- 3303
- 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
- 5520
- Möbius Function
- -1
- Radical
- 8601
- 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
- 65
- 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 95.at n=31A020223
- Multiplicity of highest weight (or singular) vectors associated with character chi_116 of Monster module.at n=38A034504
- 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=34A053719
- Diagonal of triangular spiral in A051682.at n=43A081268
- Expansion of e.g.f.: 1/((1-4*x)*sqrt(1-2*x)).at n=4A090470
- Smallest number m such that the concatenation of n+1 numbers m^0, m^1,..., m^(n-1), m^n is a prime.at n=40A096469
- Numbers k such that k*(k+7) gives the concatenation of two numbers m and m+5.at n=0A116326
- a(n) = dimension of the space in which the sphere of radius n is of maximum volume.at n=36A121546
- Numbers k such that the numerator of Sum_{j=1..k} k^2/(2*j*(j+k)) is prime.at n=41A125745
- a(1) = 1; for n>1, a(n) = the smallest number p > a(n-1) such that (a(n-1)+p)/2 is a cube.at n=19A126950
- Infinite square array read by antidiagonals: Q(m, 0) = 1, Q(m, 1) = 1; Q(m, 2k) = (m - 2k + 1)*Q(m+1, 2k-1) - (2k-1)*Q(m+2,2k-2), m*Q(m, 2k+1) = (m - 2k)*Q(m+1, 2k) - 2k(m+1)*Q(m+2, 2k-1).at n=54A127080
- Define an array by Q(m, 0) = 1, Q(m, 1) = 1; Q(m, 2k) = (m - 2k + 1)*Q(m+1, 2k-1) - (2k-1)*Q(m+2, 2k-2), m*Q(m, 2k+1) = (m - 2k)*Q(m+1, 2k) - 2k(m+1)*Q(m+2, 2k-1). Sequence gives Q(0,n).at n=9A127137
- 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, 0, 0), (0, 0, 1), (0, 1, 1), (1, -1, 0), (1, 0, -1)}.at n=7A150554
- a(n) = 200*n + 1.at n=42A157956
- Number of binary strings of length n with equal numbers of 00001 and 10010 substrings.at n=14A164205
- a(n) = 5*n^2 + 5*n - 9.at n=40A166150
- Number of compositions of n such that the number of parts is divisible by the greatest part.at n=15A171634
- Wiener index of the n-sun graph.at n=45A180863
- G.f.: 1 / (1 + 12*x*G(x)^2 - 13*x*G(x)^3) where G(x) = 1 + x*G(x)^4 is the g.f. of A002293.at n=5A226761
- Smallest number m such that gcd(m,EKG(m)) = n, where EKG = A064413, the EKG sequence.at n=46A247383