8241
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11424
- Proper Divisor Sum (Aliquot Sum)
- 3183
- 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
- 5280
- Möbius Function
- -1
- Radical
- 8241
- 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
- 65
- 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
- no
- Odd
- yes
Appears in sequences
- Number of paraffins.at n=32A005999
- Triangle read by rows of numbers of permutations eliminating just card k out of n in game of Mousetrap.at n=40A028306
- a(n+1) = [ A*a(n)+B ]/p^r, where p^r is the highest power of p diving [ A*a(n)+B ] and p=2, A=2.00013, B=3.0.at n=37A029580
- a(n) = (2*n+1)*(10*n+1).at n=20A033574
- Multiplicity of highest weight (or singular) vectors associated with character chi_110 of Monster module.at n=37A034498
- Sum of first n primes of form 4k-1.at n=42A038347
- a(1) = 5; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=48A046255
- Molien series for group H_{1,3}^{8} of order 2304.at n=30A051531
- 12-gonal (or dodecagonal) numbers: a(n) = n*(5*n-4).at n=41A051624
- Number of Carmichael numbers (A002997) less than 10^n.at n=11A055553
- Smallest nontrivial multiple of n ending in n. By nontrivial one means a(n) is not equal to n or concatenation of n with itself.at n=40A083466
- Molien series for complete weight enumerators of self-dual codes over GF(9).at n=11A092071
- Numbers n such that d(n)*reversal(n)=sigma(n), where d(n) is number of positive divisors of n.at n=4A104907
- Numbers of the form 41*(2*10^n+1) where (2*10^n+1)/3 is prime (n is in the sequence A096507).at n=1A105323
- Expansion of (2+9*x-24*x^3+16*x^4-30*x^2) / ((1-x)*(2*x+1)*(2*x-1)*(4*x^2+4*x-1)).at n=5A110050
- Numbers n such that p(12n) is prime, where p(n) is the number of partitions of n.at n=18A115214
- Numbers n such that sigma(n)=8*reversal(n).at n=3A115749
- Numbers k such that k^4 contains a pandigital substring.at n=21A115934
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 0100-1100-1111 pattern in any orientation.at n=13A146789
- a(n+1) = a(n) + floor(a(n)/5) with a(0)=5.at n=43A182306