Properties of the Number 39870

Thirty-Nine Thousand Eight Hundred Seventy

Basics

Value: 39869 → 39870 → 39871

Parity: even

Prime: No

Previous Prime: 39869

Next Prime: 39877

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 5 × 443

Divisors: 1, 2, 3, 5, 6, 9, 10, 15, 18, 30

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001101110111110

Octal: 115676

Duodecimal: 1B0A6

Hexadecimal: 9bbe

Square: 1589616900

Square Root: 199.67473550752484

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 (-1 + ∏_k>=1 1 / (1 + (-x)^k))⁵. A341244

a(n) = 2ⁿ*A(n, -1/2), A(n, x) the Eulerian polynomials. A179929

a(n) is the difference between A084321(n) and the (n-1)th power of 2. A85355

Convolution of sum of cubes of divisors with itself. A87115

Triangle read by rows: the coefficients of polynomials (1/3^m-n) * ∑_k=0..m kⁿ * 2^m-k * binomial(m,k) in the variable m. A383140

a(n) = self-convolution of row n of array T given by A027960. A27978

Start with x, y; then concatenate each word in turn with all preceding words, getting·y xy xxy yxy xxxy yxxy xyxxy ...; sequence gives number of words of length n. Also binary trees by degree: x y (x,y) (x,(x,y)) (y,(x,y)) (x,(x,(x,y))) (y,(x,(x,y))) ((x,y),(x,(x,y)))... A63894

Number of strings of numbers x(i=1..7) in 0..n with sum i·x(i)² equal to n·49. A184446

Partial sums of A033617. A299903

Number of partitions satisfying cn(1,5) <= cn(0,5) + cn(2,5) + cn(3,5) and cn(4,5) <= cn(0,5) + cn(2,5) + cn(3,5). A39870