8341
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
- 8800
- Proper Divisor Sum (Aliquot Sum)
- 459
- 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
- 7884
- Möbius Function
- 1
- Radical
- 8341
- 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
- 127
- 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
- Number of nonequivalent dissections of an n-gon into 3 polygons by nonintersecting diagonals rooted at a cell up to rotation and reflection.at n=37A003452
- Consider all integer triples (i,j,k), j,k>0, with i^3=j^3+binomial(k+2,3), ordered by increasing i; sequence gives k values.at n=16A054236
- Numbers k such that A048138(k) is a prime and sets a new record for such primes.at n=27A064440
- Interprimes which are of the form s*prime, s=19.at n=2A075294
- Numbers n such that the partition function A000041(k) is even and odd the same number of times for 0 <= k <= n.at n=35A098936
- Odd interprimes divisible by 19.at n=21A126231
- G.f. satisfies: A(x) = exp( Sum_{n>=1} A(x^n) / A(-x^n) * x^n/n ).at n=11A198785
- Number of partitions of n+2 with largest inscribed rectangle having area <= n.at n=30A218623
- Numbers not multiples of 9 whose digital sum coincides with digital sum of their largest proper divisor.at n=41A219340
- Numbers k such that 23*k+1 is a square.at n=38A219393
- Number of length n 1..(2+2) arrays with no leading partial sum equal to a prime.at n=9A254533
- Numbers n such that (2^(n+7)*5^(n+6)-1024877)/9 is prime (n > 0).at n=10A266963
- Number of compositions (ordered partitions) of n into prime parts such that no two adjacent parts are equal (Carlitz compositions).at n=34A301428
- a(1) = 1, a(2) = 2, a(3) = 3; for n > 3, a(n) is the smallest positive number which has not appeared such that all the distinct prime factors of a(n-3) + a(n-2) + a(n-1) are factors of a(n).at n=34A361593
- Number of sets that can be represented as a length-n combination of commas and braces, with elements possibly repeated.at n=34A373516
- a(n) = A379597(n) - A381710(n).at n=35A381711