8413
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
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8640
- Proper Divisor Sum (Aliquot Sum)
- 227
- 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
- 8188
- Möbius Function
- 1
- Radical
- 8413
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 96
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 88.at n=15A020427
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 42 ones.at n=38A031810
- Number of conjugacy classes of elements of order n in 2.E_7(C).at n=22A045515
- Smallest value of x such that M(x) = n, where M() is Mertens's function A002321.at n=24A051400
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 24.at n=36A051965
- Numbers k such that sigma(k-2) + sigma(k+2) = sigma(2k).at n=7A067172
- Starting positions of strings of three 3's in the decimal expansion of Pi.at n=4A083610
- Right diagonal of triangle in A110339.at n=46A110341
- Least semiprime s for which the Mertens function M(s) = n.at n=28A123173
- Sum of the quadratic nonresidues of prime(n).at n=40A125615
- Composite numbers generated by the Euler polynomial x^2 + x + 41.at n=12A145292
- 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, 0), (0, 0, 1), (0, 1, 0), (1, 1, -1)}.at n=8A149937
- Number of ways to place 3 nonattacking zebras on a 3 X n board.at n=12A172221
- Triangle in which row n has n semiprimes such that (p+1)(q+1) is the same for each semiprime pq and (p+1)(q+1) is as small as possible.at n=43A180333
- Let f(m) = number of steps needed to reach a Harshad number when the map k->A062028(l) is iterated starting at m; a(n) = smallest m such that f(m) = n.at n=83A181664
- Prime-generating polynomial: a(n) = 25*n^2 - 1185*n + 14083.at n=42A181963
- Prime-generating polynomial: a(n) = 16*n^2 - 292*n + 1373.at n=32A181969
- Semiprimes generated by the Euler polynomial x^2 + x + 41.at n=12A228183
- Number of length 2+2 0..n arrays with the sum of the maximum minus twice the median plus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=13A251429
- a(n) = (1/4)*n^4 - (1/2)*n^3 + (3/4)*n^2 - (1/2)*n + 41.at n=13A259552