Properties of the Number -39089

Thirty-Nine Thousand Eighty-Nine

Basics

Value: -39090 → -39089 → -39088

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 39089

Divisors: 1, 39089

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1001100010110001

Octal: -114261

Duodecimal: -1A755

Hexadecimal: -98b1

Square: 1527949921

Square Root: 197.70938268074178

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) = n! * ∑_{k=0..floor(n/2)} (k/2)^k / (k! * (n-2·k)!). A362350

Number of partitions p of n such that min(p) <= (number of parts of p) <= max(p). A325343

Primes p such that ∑_{k=PreviousPrime(p)..p} d(k) = ∑_{k=p..NextPrime(p)} d(k), where d(k) is the number of divisors function A000005. A353552

Third term of strong prime sextets: p(m-1)-p(m-2) > p(m)-p(m-1) > p(m+1)-p(m) > p(m+2)-p(m+1) > p(m+3)-p(m+2). A54815

Cyclops Sophie-Germain primes. A183058

Value of C in y = x²+7x+C such that y is prime for all x = 0 to 4. A97436

Primes p such that 2p+1, 3p+2 and 5p-2 are also primes. A178068

Primes which yield again a prime when the digits are taken according to the lexicographically first superpermutation of corresponding order and of minimal length. A332088

Smallest index k such that the k-th prime number in base-2 contains the n-th Fibonacci number in base-2 as a contiguous substring. A377270