Properties of the Number -139552

One Hundred Thirty-Nine Thousand Five Hundred Fifty-Two

Basics

Value: -139553 → -139552 → -139551

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ⁵ × 7 ² × 89

Divisors: 1, 2, 4, 7, 8, 14, 16, 28, 32, 49

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -100010000100100000

Octal: -420440

Duodecimal: -68914

Hexadecimal: -22120

Square: 19474760704

Square Root: 373.56659379553736

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

Coefficients of polynomials (in descending powers of x) P(n,x) := -1 + P(n-1,x)², where P(1,x) = x - 1. A158984

Coefficients of polynomials Q(n,x):=-2+(1+Q(n-1,x))², where Q(1,x)=x-2. A158986

T(n,k)=4X4X4 triangular graph without horizontal edges coloring a rectangular array: number of nXk 0..9 arrays where 0..9 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223415

G.f.: ∏_n>=1 ((1-xⁿ)/(1+xⁿ))^2·n. A216406

4X4X4 triangular graph without horizontal edges coloring a rectangular array: number of nX3 0..9 arrays where 0..9 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223410

4X4X4 triangular graph without horizontal edges coloring a rectangular array: number of nX4 0..9 arrays where 0..9 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223411