Properties of the Number -6590

Five Hundred Ninety

Basics

Value: -6591 → -6590 → -6589

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 × 659

Divisors: 1, 2, 5, 10, 659, 1318, 3295, 6590

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -1100110111110

Octal: -14676

Duodecimal: -3992

Hexadecimal: -19be

Square: 43428100

Square Root: 81.17881497040962

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 integer partitions of n that cannot be partitioned into constant multisets with distinct block-sums. A381717

G.f. A(x) = ∑_n=-oo..+oo xⁿ * (1 + xⁿ)^2·n. A260147

Number of primes between n·100000 and (n+1)*100000. A38825

Weak Goodstein sequence beginning with 266. A265034

Number of triangular regions into which a figure made up of a row of n adjacent congruent rectangles is divided upon drawing diagonals of all possible rectangles. A324042

Numbers k such that k¹² == 1 (mod 13³). A56086

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero. A316455

Expansion of ∑_k>0 x^3·k/(1-x^k)⁴. A363607

Path-counting array T(i,j) obtained from array t in A038792 by T(i,j)=t(2i+1,j). A38738

Number of self-conjugate three-quadrant Ferrers graphs that partition n. A59777