8343
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 12584
- Proper Divisor Sum (Aliquot Sum)
- 4241
- 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
- 5508
- Möbius Function
- 0
- Radical
- 309
- Omega Function (Ω)
- 5
- 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
- no
- Squarefree Number
- no
- 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) = 1 + n/2 + 9*n^2/2.at n=43A006137
- Multiplicity of highest weight (or singular) vectors associated with character chi_12 of Monster module.at n=40A034400
- Triangle of rooted planar maps, read by rows.at n=57A046652
- Digits d in decimal expansion of n replaced with d^3.at n=27A048390
- Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1<x<y<z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791), and increasing values of y in case of ties. Sequence gives values of y.at n=13A050793
- Numbers n such that the partition function A000041(k) is even and odd the same number of times for 0 <= k <= n.at n=36A098936
- G.f.: x*(1 - x + x^2)/((1-x)^2 * (1 - x - x^2)).at n=17A104161
- Numbers n such that 12*n^2 + 13 is a square.at n=7A106256
- Number of subsets of {1,2,3,...,n} whose sum is a cube.at n=18A126111
- Number of partitions of n minus number of divisors of n.at n=31A144300
- a(n) = Sum_{i=0..n} digsum_4(i)^3, where digsum_4(i) = A053737(i).at n=62A231666
- Values of x satisfying x^2 = floor(y^2/3 + y).at n=11A232771
- Sum of the largest parts in the partitions of 4n into 4 parts with smallest part = 1.at n=13A240711
- Expansion of g.f. 1 / Product_{n>=0} (1 - x^(n+3))^((n+1)*(n+2)/2!).at n=18A264923
- Somos's sequence {b(3,n)} defined in comment in A078495: a(0)=a(1)=...=a(8)=1; for n>=9, a(n)=(a(n-1)*a(n-8)+a(n-4)*a(n-5))/a(n-9).at n=22A268199
- Values of a^3 + b^3 such that the equation a^3 + b^3 = x^2 + y^2 + z^2 is not soluble where a, b > 0 and x, y, z >= 0.at n=21A272174
- Number of n-step tri-directional self-avoiding walks on the hexagonal lattice.at n=10A272265
- Expansion of Sum_{i>=0} x^(2^i)/(1 - x^(2^i)) / Product_{j>=0} (1 - x^(2^j)).at n=41A281688
- Number of partitions p of n such that min(p) <= (number of parts of p) < max(p).at n=35A325341
- Primitive terms of A334117: odd numbers m such that sigma(m, -1) >= 3/2 with no proper divisors sharing this property.at n=43A334118