Properties of the Number -4559

Five Hundred Fifty-Nine

Basics

Value: -4560 → -4559 → -4558

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 47 × 97

Divisors: 1, 47, 97, 4559

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1000111001111

Octal: -10717

Duodecimal: -277B

Hexadecimal: -11cf

Square: 20784481

Square Root: 67.52036729757918

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

Sequence is defined by property that binomial transform of (a0,a1,a2,a3,...) = (a0,a0,a0,a1,a1,a1,a2,a2,a2,a3,a3,a3,...). A51166

Expansion of ∑_k>=1 x^k/(1 + x^k)⁴. A320901

T(n,m) equals number of solid partitions of n containing m plane partitions. A94504

T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 nXk array. A220153

Prefixing, suffixing or inserting a 9 in the number anywhere gives a prime. A69833

Smallest base b > 1 such that both prime(n) and prime(n+1) are base-b Wieferich primes, i.e., p = prime(n) satisfies b^p-1 == 1 (mod p²) and q = prime(n+1) satisfies b^q-1 == 1 (mod q²). A259075

Expansion of (1/x) * Series_Reversion( x*(1-x)³/(1-x+x³) ). A366052

a(n) = 8·n² + 14·n + 5. A181890

T(n,k)=Number of nXk 0..4 arrays with each element·equal to the number of its horizontal and vertical neighbors equal to 2,3,1,0,4 for x=0,1,2,3,4. A196746

Numbers k such that 4 is the smallest decimal digit of k³. A291643