Properties of the Number -39051

Thirty-Nine Thousand Fifty-One

Basics

Value: -39052 → -39051 → -39050

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 4339

Divisors: 1, 3, 9, 4339, 13017, 39051

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1001100010001011

Octal: -114213

Duodecimal: -1A723

Hexadecimal: -988b

Square: 1524980601

Square Root: 197.61325866449346

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) = A273059(4n+2). A275918

Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 310", based on the 5-celled von Neumann neighborhood. A281038

Number of compositions of n such that the smallest part has multiplicity two. A241862

a(n) is the number of positive integer solutions of n·x*y·z*v·w = (x + n) * (y + n) * (z + n) * (v + n) * (w + n), x <= y <= z <= v <= w. A381644

7th diagonal of triangle in A059317. A106173

a(n) is the number of decompositions of H(n,1) into disjoint unions of H(j,k) where H(j,k) is the set of numbers { (2·i-1)*(2·k-1), 1 <= i <= j }. A336739

Let Product[1+Sum[b(i,j) x^i·j,{i,1,Infinity}],{j,1,Infinity}]=1+Sum[c(n) xⁿ,{n,1,Infinity}], where b(i,j) is plus or minus one and c(n) is plus or minus one or zero. Furthermore, let b(1,1)=1 (for definiteness). Then, for a given n, a(n) is the number of ways in which the coefficients b(i,j) i<=n, j<=n can be chosen. A88857