ℕ atory
Play Now

Properties of the Number -12082

Twelve Thousand Eighty-Two

Basics

Value: -12083 → -12082 → -12081

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 × 7 × 863

Divisors: 1, 2, 7, 14, 863, 1726, 6041, 12082

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10111100110010

Octal: -27462

Duodecimal: -6BAA

Hexadecimal: -2f32

Square: 145974724

Square Root: 109.91815136727874

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

Numbers whose sum of divisors is a fourth power. A19422
First terms "a" of quadruples a>b>c>d>0 with six square pairwise sums. A175534
Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 446", based on the 5-celled von Neumann neighborhood. A288338
Floor[ X/Y] where X = concatenation of the squares and Y = concatenation of natural numbers. A67102
Numerators of continued fraction convergents to sqrt(510). A41974
Number of nondecreasing -2..2 vectors of length n whose dot product with some other -2..2 vector equals n. A226334
a(n) = T(n,n-3), where T is the array in A026386. A26394
Number of -3..3 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)t+u+v) having four, five, six or seven distinct values for every i,j,k<=n. A211742
Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 126", based on the 5-celled von Neumann neighborhood. A270215
Triangular array read by rows: T(n,k) is the number of simple labeled graphs on n nodes with exactly k components where each component has at most one cycle; n>=1, 1<=k<=n. A217756