Properties of the Number -1212

Two Hundred Twelve

Basics

Value: -1213 → -1212 → -1211

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 6

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 101

Divisors: 1, 2, 3, 4, 6, 12, 101, 202, 303, 404

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -10010111100

Octal: -2274

Duodecimal: -850

Hexadecimal: -4bc

Square: 1468944

Square Root: 34.813790371058424

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.: ∑_n>=0 xⁿ * (xⁿ + i)ⁿ / (1 + i·xⁿ⁺¹)ⁿ⁺¹, where i² = -1. A323675

G.f.: ∑_n>=0 xⁿ * (1 - xⁿ⁺¹)ⁿ / (1 + xⁿ⁺¹)ⁿ⁺¹. A323695

First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 646", based on the 5-celled von Neumann neighborhood. A273329

Expansion of s(q)⁴ in powers of q where s() is a cubic AGM function. A133078

Triangle read by rows. Polynomials based on sums of Moebius transforms. A177977

G.f. A(x) satisfies A(x) = ( 1 + 16·x*A(x)/(1 - x·A(x)) )^1/4. A372020

A triangular sequence of coefficients from the inverse substitution of the spherical Bessel polynomial recursion: B(x, n) = (-2/x)*B(x, n-1) - (k² - (n*(n-1)/x²))*B(x, n-2), with k=1 and substitution x->1/y. A137477

a(n) = ∑_k=0..n p(k) where p(k) = number of partitions of k (A000041). A70

Number of partitions of n into an odd number of parts. A27193

Number of palindromic partitions of n. A25065