Properties of the Number -16068

Sixteen Thousand Sixty-Eight

Basics

Value: -16069 → -16068 → -16067

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 13 × 103

Divisors: 1, 2, 3, 4, 6, 12, 13, 26, 39, 52

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11111011000100

Octal: -37304

Duodecimal: -9370

Hexadecimal: -3ec4

Square: 258180624

Square Root: 126.7596150199266

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 m with m-1, m+1 and prime(m)+2 all prime. A259539

Expansion of ∏_k=1..12 theta₃(q^k), where theta₃() is the Jacobi θ function. A320246

G.f.: ∑_k>=1 (k³ * x^k² / ∏_j=1..k (1 - x^j)). A333151

The number of n-step self avoiding walks on a 3D cubic lattice confined inside a box of size 2x2x2 where the walk starts at the middle of the box's edge. A335806

Table read by antidiagonals: T(h,n) is the number of n-step self avoiding walks on a 3D cubic lattice confined inside a box of size 2h X 2h X 2h where the walk starts at the middle of the box's edge. A336862

a(n) = ∑_k=0..n binomial(2·n, n-k) * p(k), where p(k) is the partition function A000041. A356280

a(n) = prime(n) + prime(n²). A92504

a(n) = ∑_d∣n d·binomial(d+n/d-1, d). A338658

a(n) = [xⁿ] ∏_k=1..n (x^k² + 1 + 1/x^k²). A369433

Index of first occurrence of -n in A000319, or -1 if -n never appears there. A381231