8502
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
- 16
- Divisor Sum
- 18480
- Proper Divisor Sum (Aliquot Sum)
- 9978
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2592
- Möbius Function
- 1
- Radical
- 8502
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 83
- 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
- Number of partitions of n into Fibonacci parts (with 2 types of 1).at n=36A007000
- Second differences of Catalan numbers A000108.at n=8A026012
- a(n) = T(n, [n/2]), where T is the array defined in A026009.at n=16A026021
- 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 60.at n=40A031558
- Number of partitions of n with equal number of parts congruent to each of 1 and 2 (mod 4).at n=46A035543
- Base-6 digits are, in order, the first n terms of the periodic sequence with initial period 1,0,3,2.at n=5A037683
- T(n, k) = S(2n, n, k) for 0<=k<=n and n>=0, where S(p, q, r) is the number of upright paths from (0, 0) to (p, p-q) that do not rise above the line y = x-r.at n=38A050157
- Row sums of triangle A067330; also of triangle A067418.at n=11A067988
- Expansion of (1+x^3*C^4)*C, where C = (1-(1-4*x)^(1/2))/(2*x) is g.f. for Catalan numbers, A000108.at n=9A071738
- a(n) = 2*a(n-1) + 35*a(n-2), a(0) = 0, a(1) = 1.at n=6A080920
- Square spiral of sums of selected preceding terms, starting at 1 (a spiral Fibonacci-like sequence).at n=19A094768
- Triangle read by rows: counts ordered trees by number of edges and position of first edge that terminates at a vertex of outdegree 1.at n=58A098977
- a(n) = ceiling( Sum_{i=1..n-1} a(i)/5 ), a(1)=1.at n=53A120170
- a(n) = number of solutions to the Diophantine equation x+y^2+z^3=n^4 with positive x,y,z all distinct.at n=15A121984
- Triangle read by rows, giving Kekulé numbers for certain benzenoids (see the Cyvin-Gutman book for details).at n=53A123353
- G.f. satisfies: A(x) = 1/(1-x) * A(x^2)*A(x^3)*A(x^4)*...*A(x^n)*...at n=24A129374
- 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, -1), (-1, 0, 1), (1, -1, 1), (1, 1, 0)}.at n=8A149207
- 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, 1), (0, 1, 0), (0, 1, 1), (1, -1, -1)}.at n=8A149903
- a(n) = (2*n^3 + 9*n^2 + n + 24) / 6.at n=28A160805
- Number of lines through at least 2 points of a 6 X n grid of points.at n=32A160846