Properties of the Number -8343

Three Hundred Forty-Three

Basics

Value: -8344 → -8343 → -8342

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ⁴ × 103

Divisors: 1, 3, 9, 27, 81, 103, 309, 927, 2781, 8343

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10000010010111

Octal: -20227

Duodecimal: -49B3

Hexadecimal: -2097

Square: 69605649

Square Root: 91.34002408582998

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Number of partitions of n minus number of divisors of n. A144300

G.f.: x*(1 - x + x²)/((1-x)² * (1 - x - x²)). A104161

Digits d in decimal expansion of n replaced with d³. A48390

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). A268199

Consider the Diophantine equation x³ + y³ = z³ + 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. A50793

a(n) = 1 + n/2 + 9·n²/2. A6137

Number of subsets of {1,2,3,...,n} whose sum is a cube. A126111

a(n) = ∑_i=0..n digsum₄(i)³, where digsum₄(i) = A053737(i). A231666

Expansion of g.f. 1 / ∏_n>=0 (1 - xⁿ⁺³)⁽ⁿ⁺¹*(n+2)/2!). A264923

Number of partitions p of n such that min(p) <= (number of parts of p) < max(p). A325341