Properties of the Number -16812

Sixteen Thousand Eight Hundred Twelve

Basics

Value: -16813 → -16812 → -16811

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 467

Divisors: 1, 2, 3, 4, 6, 9, 12, 18, 36, 467

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100000110101100

Octal: -40654

Duodecimal: -9890

Hexadecimal: -41ac

Square: 282643344

Square Root: 129.66109670984585

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

Number of points on surface of cuboctahedron (or icosahedron): a(0) = 1; for n > 0, a(n) = 10n² + 2. Also coordination sequence for f.c.c. or A₃ or D₃ lattice. A5901

Main diagonal of array in A358304, divided by 2. A358307

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 1 1 and 1 1 0 vertically. A207564

a(n) = 7ⁿ + n. A226199

T(n,k) = Number of (n+1) X (k+1) white-square subarrays of 0..2 arrays with no element equal to a strict majority of its diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order. A231131

T(n,k)=Number of (n+1)X(k+1) black-square subarrays of 0..2 arrays with no element equal to a strict majority of its diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order. A231137

Number of partitions p of n such that the number of parts having multiplicity 1 is a part and max(p) - min(p) is a part. A241447

Coordination sequence for Cr3Si, Si position. A9927

Number of primitive (aperiodic, or Lyndon) necklaces with n beads of unlabeled colors such that the numbers of beads per color are distinct. A261599

a(n) = 3·p(n), where p(n) is the number of partitions of n. A299473