8058
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 17280
- Proper Divisor Sum (Aliquot Sum)
- 9222
- 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
- 2496
- Möbius Function
- 1
- Radical
- 8058
- 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
- 96
- 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
- Expansion of 1 / ((1-x)^2*(1-x^2)*(1-x^3)*(1-x^4)).at n=41A002621
- Numbers k such that 247*2^k+1 is prime.at n=21A032500
- Number of partitions satisfying cn(2,5) <= cn(0,5) + cn(1,5) + cn(4,5) and cn(3,5) <= cn(0,5) + cn(1,5) + cn(4,5).at n=32A039871
- Integers n > 7059 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 7059.at n=10A063058
- a(n) = (1/6)*(n+1)*(10*n^2 + 17*n + 12).at n=16A102296
- Number of imprimitive (periodic) asymmetric rhythm cycles: ones having nontrivial shift automorphisms. Asymmetric rhythm cycles (A115114): binary necklaces of length 2n subject to the restriction that for any k if the k-th bead is of color 1 then the (k+n)-th bead (modulo 2n) is of color 0.at n=32A115116
- Cascadence of (1+x)^3; a triangle, read by rows of 3n+1 terms, that retains its original form upon convolving each row with [1,3,3,1] and then letting excess terms spill over from each row into the initial positions of the next row such that only 3n+1 terms remain in row n for n>=0.at n=51A120919
- G.f. satisfies: A(x) = G(x)^3 * A(x^4*G(x)^9), where G(x) is the g.f. of the number of ternary trees (A001764): G(x) = 1 + x*G(x)^3.at n=6A120920
- 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, 1), (-1, 0, 1), (-1, 1, -1), (0, 0, 1), (1, 0, -1)}.at n=10A148177
- Partial sums of Pillai primes (A063980).at n=33A172034
- Arises in a refined modular approach to the Diophantine equation x^2+y^62=z^3.at n=9A172408
- Numbers n for which A020652(n)/A038567(n) = A182972(n)/A182973(n).at n=6A182974
- Triangle of coefficients of polynomials u(n,x) jointly generated with A209136; see the Formula section.at n=48A209135
- Positions of records in A213726.at n=12A218548
- Numbers which are the roots of distinct not-previously-encountered side-trees ("tendrils") sprouting from the side of the infinite beanstalk (see A213730).at n=24A218612
- Number of nX1 0..2 arrays with no more than floor(nX1/2) elements unequal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=13A222364
- Number of nX2 0..2 arrays with no more than floor(nX2/2) elements unequal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..2 order.at n=6A222980
- T(n,k)=Number of nXk 0..2 arrays with no more than floor(nXk/2) elements unequal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..2 order.at n=34A222986
- Number of 7Xn 0..2 arrays with no more than floor(7Xn/2) elements unequal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..2 order.at n=1A222992
- Least numbers k for each base b >= 2 such that N = b^(2^n) + k is prime for 6 consecutive values from n = 0 to n = 5.at n=9A225492