Properties of the Number -2010

Ten

Basics

Value: -2011 → -2010 → -2009

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 3

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 5 × 67

Divisors: 1, 2, 3, 5, 6, 10, 15, 30, 67, 134

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: -11111011010

Octal: -3732

Duodecimal: -11B6

Hexadecimal: -7da

Square: 4040100

Square Root: 44.83302354291979

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

Expansion of ψ(x)² * φ(-x)⁶ in powers of·where φ(), ψ() are Ramanujan θ functions. A227695

a(n) = n - 2^{sum of digits of n}. A328882

Expansion of ∏_k>0 theta₃(q^2·k)/theta₃(q^2·k-1), where theta₃() is the Jacobi θ function. A321027

G.f.: 1/(1 + x/(1 + x³/(1 + x⁶/(1 + x¹⁰/(1 + x¹⁵/(1 + ... + x^k*(k+1/2)/(1 + ...))))))), a continued fraction. A285484

a(1)=0; thereafter a(n) = (n-1)*σ(n)-n*σ(n-1) where σ is the sum-of-divisors function A000203. A335153

Integers written in factorial base. A7623

Number of 2n-bead balanced binary necklaces of fundamental period 2n, equivalent to reversed complement; also Dirichlet convolution of b_n=2^n-1 with μ(n); also number of components of Mandelbrot set corresponding to Julia sets with an attractive n-cycle. A740

Numbers whose sum of digits is 3. A52217

Number of integer compositions of n with all equal run-sums. A353851

Representation of n in base of Catalan numbers (a classic greedy version). A14418