8366
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12960
- Proper Divisor Sum (Aliquot Sum)
- 4594
- 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
- 4048
- Möbius Function
- -1
- Radical
- 8366
- 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
- 39
- 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
- Numbers k such that sigma(k) = sigma(k+8).at n=15A015876
- Numbers k such that sigma(k) = sigma(k+12).at n=34A015882
- a(n) = floor(2nd elementary symmetric function of Sum_{j=1..k} 1/j, k = 1,2,...,n).at n=37A025212
- Decimal part of cube root of a(n) starts with 3: first term of runs.at n=18A034129
- Multiplicity of highest weight (or singular) vectors associated with character chi_66 of Monster module.at n=38A034454
- Numbers whose base-4 representation contains exactly two 0's and four 2's.at n=30A045051
- Numbers k such that k*2^k - k - 1 is prime.at n=20A046843
- Starting positions of strings of 3 1's in the decimal expansion of Pi.at n=8A050209
- Composite numbers k such that phi(k + d(k)) = phi(k) + d(k), where phi() = A000010(), d() = A000005().at n=15A063702
- a(n) = floor(binomial(n+7,7)/binomial(n+3,3)).at n=46A084628
- Least inverse of A115247, or -1 if no inverse exists.at n=14A115250
- Numbers k such that k + prime(k) gives a triangular number.at n=33A115882
- a(n) = 2*a(n-1) - a(n-2) + n + 1.at n=35A121968
- Numbers k such that k and k^2 use only the digits 3, 5, 6, 8 and 9.at n=7A137134
- Triangle T(n,k) read by rows. T(n,1)=1; T(n,k) = Sum_{i=1..k-1} ( T(n-i,k-1) + T(n-i,k) ), k>1.at n=70A175105
- Numbers n such that n^2 contains no digit less than 5.at n=34A175471
- Half the number of n X n binary arrays with no element equal to a strict majority of its diagonal and antidiagonal neighbors.at n=4A183398
- Half the number of nX5 binary arrays with no element equal to a strict majority of its diagonal and antidiagonal neighbors.at n=4A183401
- T(n,k)=Half the number of nXk binary arrays with no element equal to a strict majority of its diagonal and antidiagonal neighbors.at n=40A183402
- High water marks in A177413.at n=9A184952