Properties of the Number -13209

Thirteen Thousand Two Hundred Nine

Basics

Value: -13210 → -13209 → -13208

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 7 × 17 × 37

Divisors: 1, 3, 7, 17, 21, 37, 51, 111, 119, 259

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11001110011001

Octal: -31631

Duodecimal: -7789

Hexadecimal: -3399

Square: 174477681

Square Root: 114.9304137293519

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

Number of partitions of n into parts of 3 kinds. A716

Logarithmic numbers: expansion of the e.g.f. -log(1-x) * e^-x. A2741

Molien series for cyclic group of order 5. A8646

Exponential generating function is -f(x) * Integral_{t = 0..x} exp(exp(-t) - 1) dt, where f(x) = exp(1 - x - exp(-x)) is the exponential generating function for A014182. A14619

Smallest k such that k·2*p(n)²-1=q is prime, k·2*q²-1=r, k·2*r²-1=s, k·2*r²-1=t, r, s, and t are also prime. A224492

Triangle read by rows: T(n, k) = ∑_j=0..n binomial(-j-1, -n-1)*S1(j, k) where S1 are the Stirling cycle numbers A132393. A269953

a(n) = floor(C(n,4)/5). A11795

Divide odd numbers into groups with prime(n) elements and add together. A34960

a(n) = n·Fibonacci(n) - ∑_i=0..n Fibonacci(i). A122491

a(n) = n*(16·n² + 3·n - 13)/6. A172078