Properties of the Number -5596

Five Hundred Ninety-Six

Basics

Value: -5597 → -5596 → -5595

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 1399

Divisors: 1, 2, 4, 1399, 2798, 5596

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1010111011100

Octal: -12734

Duodecimal: -32A4

Hexadecimal: -15dc

Square: 31315216

Square Root: 74.80641683706017

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 labeled simple graphs covering n vertices and satisfying a strict version of the axiom of choice. A367869

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

Sum of products of squares of parts in all partitions of n. A77335

Number of compositions of n whose run-lengths are unimodal. A332726

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010011. A260767

a(n) = ∑_k=1..n ∑_d=1..k (k mod d). A72481

Number of 3-uniform hypergraphs on n labeled vertices where no two edges have two vertices in common. A323293

Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives k values. A53721

Number of ways to place 3 nonattacking zebras on an n X n board. A172138

Numbers k such that k⁴ contains a pandigital substring. A115934

We use cookies

Some cookies are essential for Natory to function, like keeping you signed in. We also use optional cookies to understand how the app is used and improve it over time. Learn more in our Privacy Policy. You can manage your preferences anytime.