8339
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
- 4
- Divisor Sum
- 8640
- Proper Divisor Sum (Aliquot Sum)
- 301
- 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
- 8040
- Möbius Function
- 1
- Radical
- 8339
- 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
- 158
- 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
- a(n) = (d(n)-r(n))/2, where d = A026049 and r is the periodic sequence with fundamental period (1,0,0,1).at n=32A026050
- Numbers n such that n^2 + (n+1)^2 + (n+2)^2 is palindromic.at n=5A027573
- Numbers k such that phi(k) divides sigma(k+1) + sigma(k).at n=46A067246
- G.f.: A(x) = ( G(x)^11 - G(x^11) - 11*x*((1-x^10)/(1-x))/(1-x^11) )/(121*x^2) where G(x) is the g.f. of A110644.at n=5A111585
- Number of base 23 circular n-digit numbers with adjacent digits differing by 1 or less.at n=7A124716
- Odd positive integers a(n) such that for every odd integer m>=7 there exists a unique representation of the form m=a(p)+2a(q)+4a(r).at n=23A147845
- 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=42A180333
- Number of (n+2) X 3 binary arrays with each 3 X 3 subblock having rows and columns in lexicographically nondecreasing order.at n=26A184540
- Irregular array read by rows. a(n) is the largest element in the primitive Collatz-like 3x-k cycle associated with A226623(n).at n=21A226624
- Integers m such that m' = Sum_{i=1..k-1} (Sum_{j=1..i} d_(k-j+1)*10^(i-j))', where m' is the arithmetic derivative of m and the digits of m are given by d_(k)*10^(k-1) + d_(k-1)*10^(k-2) + ... + d_(2)*10 + d_(1).at n=20A244077
- Number of (n+1) X (5+1) 0..1 arrays with every 2 X 2 subblock ne-sw antidiagonal difference nondecreasing horizontally and nw+se diagonal sum nondecreasing vertically.at n=5A258551
- Number of (6+1) X (n+1) 0..1 arrays with every 2 X 2 subblock ne-sw antidiagonal difference nondecreasing horizontally and nw+se diagonal sum nondecreasing vertically.at n=4A258559
- Expansion of Sum_{k>=1} (k*(5*k - 3)/2)*x^k/(1 - x^k).at n=48A278947
- Composite numbers k such that Pell(k) == 1 (mod k).at n=19A319042
- Prime generating polynomial: a(n) = (4*n - 29)^2 + 58.at n=29A320772
- Composite numbers k coprime to 8 such that k divides Pell(k - Kronecker(8,k)), Pell = A000129.at n=21A327651
- a(n) is the first number k with A340967(k) = n.at n=11A340969
- Discriminants of imaginary quadratic fields with class number 26 (negated).at n=38A351664