Properties of the Number -12066

Twelve Thousand Sixty-Six

Basics

Value: -12067 → -12066 → -12065

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 2011

Divisors: 1, 2, 3, 6, 2011, 4022, 6033, 12066

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10111100100010

Octal: -27442

Duodecimal: -6B96

Hexadecimal: -2f22

Square: 145588356

Square Root: 109.8453458276681

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

a(n) = 2·n*Fibonacci(n-2) + (-1)ⁿ + 1. A309874

Number of n-node graphs with no cycles of length less than 5. A6787

Number of cyclic subgroups of the group SL(2, Z(n)), counting conjugates as distinct. A316537

Expansion of g.f. A(x) satisfying A(x) = (1 + 3·x*A(x)) * (1 + x·A(x)²). A375435

Numbers k such that sum of factorials of digits of k equals π(k) (A000720). A49529

Lesser of twin admirable numbers: k such that k and k+2 are both admirable numbers. A109730

Number of ways to place 4 nonattacking bishops on a 4 X n board. A172208

Triangle of coefficients of polynomials u(n,x) jointly generated with A209831; see the Formula section. A209830

a(n) is the number of edges formed by n-secting the angles of a hexagon. A335735

a(n) gives smallest number requiring n iterations of the map i -> A053392(i) to reach zero. A60630