Properties of the Number -139104

One Hundred Thirty-Nine Thousand One Hundred Four

Basics

Value: -139105 → -139104 → -139103

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ⁵ × 3 ³ × 7 × 23

Divisors: 1, 2, 3, 4, 6, 7, 8, 9, 12, 14

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100001111101100000

Octal: -417540

Duodecimal: -68600

Hexadecimal: -21f60

Square: 19349922816

Square Root: 372.96648643008126

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

Matrix inverse of triangle A136501, read by rows. A136502

cosh(arcsinh(x)*log(x+1))=1+12/4!*x⁴-60/5!*x⁵+210/6!*x⁶... A12581

Fibonacci sequence beginning 0, 3. A22086

The sum of the two numbers in an amicable pair, A002025(n) + A002046(n). A180164

a(n) = 3·Fibonacci(2·n) + 0ⁿ. A97134

a(0) = 1; for n>0, a(n) = 3·Fibonacci(n). A97135

Row sums of A131325. A131326

a(n) = Fibonacci(n)*A132973(n) for n>=1, with a(0)=1, where A132973 lists the coefficients in ψ(-q)³/ψ(-q³) and where ψ() is a Ramanujan θ function. A205970

The sum (in nondecreasing order) of the two numbers in an amicable pair. A259953

Triangular array: the fusion of polynomial sequences P and Q given by p(n,x)=(x+2)ⁿ and q(n,x)=(x+1)ⁿ. A193724