Properties of the Number -5883

Eight Hundred Eighty-Three

Basics

Value: -5884 → -5883 → -5882

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 37 × 53

Divisors: 1, 3, 37, 53, 111, 159, 1961, 5883

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1011011111011

Octal: -13373

Duodecimal: -34A3

Hexadecimal: -16fb

Square: 34609689

Square Root: 76.70071707617863

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) = -(1/n) * ∑_d∣n φ(n/d) * (-3)^d. A343465

First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 305", based on the 5-celled von Neumann neighborhood. A271163

Number of vertices formed by drawing the lines connecting any two of the 2*(n+2) perimeter points of a 3 X (n+1) rectangular grid of points (or equally, a 2 X n grid of squares). A331763

Least k such that there are exactly n multisets that can be obtained by choosing a divisor of each prime index of k. A355734

Number of ordered triples (i,j,k) with |i|,|j|,|k|,|i·j*k| <= n and gcd(i,j,k) <= 1. A226357

Number of twice-partitions of n into odd-length partitions. A358334

T(n,k)=Number of nXk 0..2 arrays with rows, antidiagonals and columns unimodal. A223725

For any number n take the polynomial formed by the product of the terms (x-π), where π's are the prime factors of n. Then calculate the area between the minimum and the maximum value of the prime factors. This sequence lists the numbers for which the area is a positive integer. A203612

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

Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 3x, p(n,x) = u·p(n-1,x) + v·p(n-2,x) for n >=3, where u = p(2,x), v = 2 - x². A368151