Properties of the Number -5591

Five Hundred Ninety-One

Basics

Value: -5592 → -5591 → -5590

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 5591

Divisors: 1, 5591

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1010111010111

Octal: -12727

Duodecimal: -329B

Hexadecimal: -15d7

Square: 31259281

Square Root: 74.77298977572049

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

Matrix inverse of triangle A063967. A91698

a(0)=2; for n>=1, a(n) = smallest prime p such that there is a gap of exactly 2n between p and next prime, or -1 if no such prime exists. A230

Number of combinations which can be taken from the integer partitions of n. Total number of cases in the (n,m)-fragmentation process. A122768

Fourth spoke of a hexagonal spiral. A56108

Numbers k such that (5^k + 2^k)/7 is prime. A82387

Number of partitions of n in which each part, with the possible exception of the largest, occurs at least twice. A116931

Artiads: the primes p == 1 (mod 5) for which Fibonacci((p-1)/5) is divisible by p. A1583

Maximal coefficient of the polynomial (1-x)*(1-x²)*...*(1-xⁿ). A86376

Primes congruent to 2 mod 23. A141908

Smallest prime p(k) such that the number of distinct prime divisors of all composite numbers between p(k) and p(k+1) is n. A75580