Properties of the Number -39819

Thirty-Nine Thousand Eight Hundred Nineteen

Basics

Value: -39820 → -39819 → -39818

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 13 × 1021

Divisors: 1, 3, 13, 39, 1021, 3063, 13273, 39819

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1001101110001011

Octal: -115613

Duodecimal: -1B063

Hexadecimal: -9b8b

Square: 1585552761

Square Root: 199.54698694793666

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

Expansion of ∏_m>=1 (1+m·q^m)^-13. A22705

Absolute discriminants of complex quadratic fields with 3-class group of type (3,3), 3-principalization type (4443), IPAD [(3,3,3)³, (3,9)], and Hilbert 3-class field tower of unknown length at least 3. A242873

Numbers that can be represented in more than one way as p²+p·q+q² with p and q primes, p<=q. A349987

a(n) = ((1 + 3·sqrt(2))ⁿ - (1 - 3·sqrt(2))ⁿ)/(2·sqrt(2)). A125817

Sum of the numbers already killed in the first jump of a Sieve of Eratosthenes table. A179628

Record high-points in A367356. A367598

a(n) = round( 2*γ(3 + n/3) + 2^n/3 ). A133756

Sequence defined by the recurrence formula a(n+1)=sum(a(p)*a(n-p)+k,p=0..n)+l for n>=1, with here a(0)=1, a(1)=3, k=-1 and l=-1. A176956

Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..2 array extended with zeros and convolved with 1,4,6,4,1. A221993

a(n) = 4·n³ - 6·n² + 6·n - 2 + (-1)ⁿ. A382973