Properties of the Number -12072

Twelve Thousand Seventy-Two

Basics

Value: -12073 → -12072 → -12071

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 503

Divisors: 1, 2, 3, 4, 6, 8, 12, 24, 503, 1006

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -10111100101000

Octal: -27450

Duodecimal: -6BA0

Hexadecimal: -2f28

Square: 145733184

Square Root: 109.87265355856297

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 (φ(-q) / φ(q))² in powers of q where φ() is a Ramanujan θ function. A139820

Expansion of theta₃ / theta₄. A7096

Expansion of (theta₃(q) / theta₄(q))² in powers of q. A14969

Triangle read by rows: T(n,k) = number of permutations of [n] allowing i->i+j (mod n), j=0..k-1. A8305

a(n) = |{m : multiplicative order of 8 mod m = n}|. A59890

Number of partitions of n into divisors > 1 of n. A211110

Number of discordant permutations of length n. A183

Number of permutations p of [n] with no fixed points and cyclic displacement of elements restricted by three: p(i)<>i and (i-p(i) mod n <= 3 or p(i)-i mod n <= 3). A260081

Numbers k such that σ(k) divides σ(σ(k)). A66961

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the upper median plus the lower median minus the minimum of every 2X2 subblock equal. A236728