Properties of the Number -1209

Two Hundred Nine

Basics

Value: -1210 → -1209 → -1208

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 13 × 31

Divisors: 1, 3, 13, 31, 39, 93, 403, 1209

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: -10010111001

Octal: -2271

Duodecimal: -849

Hexadecimal: -4b9

Square: 1461681

Square Root: 34.77067730142742

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

Triangle T(n,k) read by rows: coefficient [x^k] of the polynomial p(n,x) with p(0,x) = 1, p(1,x) = 2 - x, p(2,x) = 1 - 4·x + x² and p(n,x) = (2-x)*p(n-1,x) - p(n-2,x) if n>2. A136674

Coefficients of the eighth-order mock θ function T₀(q). A153155

E.g.f. satisfies: A(x) * log(A(x)) = 1 - exp(-x·A(x)²). A349602

Dirichlet g.f.: 1 / (ζ(s) * ζ(s-1) * ζ(s-2)). A328254

Hankel transform of number of divisors sequence (A000005). A56225

tanh(sec(x)*arctan(x))=x-1/3!*x³+25/5!*x⁵-1209/7!*x⁷+68945/9!*x⁹... A12809

Number of rucksack partitions of n: every consecutive constant subsequence has a different sum. A353864

Number of integer partitions of n containing three parts (a,b,c) (repeats allowed) such that a + b = c. A variation of sum-full partitions. A363225

Number of partitions of n with a product greater than n. A114324

|First digit - second digit + third digit - fourth digit ...| = 10. A60978