8603
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
- 4
- Divisor Sum
- 9840
- Proper Divisor Sum (Aliquot Sum)
- 1237
- 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
- 7368
- Möbius Function
- 1
- Radical
- 8603
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 171
- 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 unilateral digraphs with n unlabeled nodes.at n=5A003088
- Expansion of 1/((1-2x)(1-3x)(1-8x)).at n=4A016277
- Write 1,2,... in a clockwise spiral; sequence gives numbers on positive x axis.at n=46A033951
- Erroneous version of A003088.at n=5A039747
- a(n) = binomial(n,0) - binomial(n,2) + binomial(n,4).at n=23A058923
- a(n) = (9*n^2 + 13*n + 6)/2.at n=43A064226
- Number of different isotemporal classes of diasters with n peripheral edges.at n=45A109622
- Semiprimes in A033951.at n=15A113691
- Number of partitions of n into parts with at most one part not greater than 2.at n=43A121659
- a(n) = a(n-1) + Sum_{k=0..floor(log_2(n-1))} a(2^k), a(1) = 1.at n=28A133147
- a(n) = (9*n^2 - 5*n + 2)/2.at n=44A140064
- Number of n X n binary arrays symmetric about the diagonal and under 90-degree rotation with all ones connected only either four adjacent vertically or four adjacent horizontally.at n=20A145794
- Values x for records of minima of the positive distance d between an 11th power of a positive integer x and a square of an integer y such that d = x^13 - y^2 (x<>k^2 and y<>k^13).at n=48A179799
- Concentric 17-gonal numbers.at n=45A195047
- If, for some m, A098550(m-2) is a prime p and A098550(m) = 7p, add 7p to the sequence.at n=40A253054
- Sums of seven consecutive squares: a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2 + (n+4)^2 + (n+5)^2 + (n+6)^2.at n=35A260637
- Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 78", based on the 5-celled von Neumann neighborhood.at n=14A278789
- a(n) is the number of permutations of length n that avoid the pattern 321 and the mesh pattern (12, 106) or the same sequence for the mesh patterns (12, 122), (12, 142), (12, 158), (12, 172), (12, 188), (12, 226), (12, 242).at n=11A289453
- Partial sums of A299254.at n=17A299260
- Number of n-node rooted trees in which four equals the maximal number of nodes in paths starting at a leaf and ending at the first branching node or at the root.at n=10A318900