Properties of the Number -18109

Eighteen Thousand One Hundred Nine

Basics

Value: -18110 → -18109 → -18108

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 7 × 13 × 199

Divisors: 1, 7, 13, 91, 199, 1393, 2587, 18109

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -100011010111101

Octal: -43275

Duodecimal: -A591

Hexadecimal: -46bd

Square: 327935881

Square Root: 134.56968455042167

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

G.f. A(x,y) satisfies: y = f(x,A(x,y)), where f(x,y) = ∑_n=-oo..oo x^n*(n+1/2) * y^n*(n-1/2) is Ramanujan's θ function. A354649

Shifts left under COMPOSE transform with itself. A30266

G.f. A(x,y) satisfies: -y = f(-x,-A(x,y)), where f(x,y) = ∑_n=-oo..oo x^n*(n+1/2) * y^n*(n-1/2) is Ramanujan's θ function. A354650

Number of permutations containing 3241 patterns only as part of 35241 patterns. A110447

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of B(x)^k, where B(x) is the g.f. of A110447. A379598

Rectangular table, read by antidiagonals, where the g.f.s of row n, R(x,n), satisfy: R(x,n+1) = R(G(x),n) for n>=0 and x·R(x,0) = G(x) = x + x·G(G(x)) is the g.f. of A030266. A128325

a(n) = A354650(n,2·n), for n >= 0. A354660

Fibonacci iteration starting with (1, a(n)) leads to a "nine digits anagram". A34587

A simple recurrence with one error. A90805

Partial sums of A048995. A174514