Properties of the Number -3239

Two Hundred Thirty-Nine

Basics

Value: -3240 → -3239 → -3238

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 41 × 79

Divisors: 1, 41, 79, 3239

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -110010100111

Octal: -6247

Duodecimal: -1A5B

Hexadecimal: -ca7

Square: 10491121

Square Root: 56.91221310052878

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

a(n) = n*(2·n-3). A14107

Number of strict integer partitions of n with no part divisible by all the others. A343377

Smallest value of·such that M(x) = n, where M() is Mertens's function A002321. A51400

Number of partitions of n into 3 or more distinct parts. A347548

Partial sums of round(n²/11). A177116

a(n) = (2·n+1) * (4·n-1). A33566

Number of n-regular, N₀-weighted pseudographs on 2 vertices with total edge weight 9, up to isomorphism. A358249

Numbers n such that the trajectory of n under the `3x+1' map reaches n - 1. A70991

a(1)=1; for n >= 2, choose a(n) so that |∑_k=1..n 1/a(k)^z| < |∑_k=1..n-1 1/a(k)^z|, where z = 1/2 + i·2*π. A84812

Relative of Hofstadter Q-sequence: a(n) = max(0, n+3201) for n <= 0; a(n) = a(n-a(n-1)) + a(n-a(n-2)) + a(n-a(n-3)) for n > 0. A373236