ℕ atory
Play Now

Properties of the Number -12010

Twelve Thousand Ten

Basics

Value: -12011 → -12010 → -12009

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 4

Digital Root: 4

Palindrome: No

Factorization: 2 × 5 × 1201

Divisors: 1, 2, 5, 10, 1201, 2402, 6005, 12010

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -10111011101010

Octal: -27352

Duodecimal: -6B4A

Hexadecimal: -2eea

Square: 144240100

Square Root: 109.59014554237986

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

Coefficient of x3 in the minimal polynomial of the continued fraction [1n,sqrt(6),1,1,...], where 1n means n ones. A266807
a(n) = 3n + (4n - 3n) * (d(n) - 3), where d(n) = A000005(n). A231919
Array read by antidiagonals: T(m,n) is the number of (undirected) Hamiltonian paths in the m X n grid graph. A332307
T(n,k)=Number of nXnXn triangular 0..k arrays with some element less than a w, nw or ne neighbor exactly once. A271034
Numbers in base -3. A73785
Zero, together with positive numbers k such that prime(k) - k is a square. A64370
T(n,k)=Number of nXk 0..2 arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two not more than once. A268809
Number of Hamiltonian paths in P4 X Pn. A3695
Consider the figure made up of a row of n adjacent congruent rectangles, with diagonals of all possible rectangles drawn; a(n) = number of interior vertices where exactly two lines cross. A334701
Full Łukasiewicz word for each rooted plane tree (interpretation e in Stanley's exercise 19) encoded by A014486 (or A063171). A79436