Properties of the Number -6994

Nine Hundred Ninety-Four

Basics

Value: -6995 → -6994 → -6993

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 × 13 × 269

Divisors: 1, 2, 13, 26, 269, 538, 3497, 6994

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1101101010010

Octal: -15522

Duodecimal: -406A

Hexadecimal: -1b52

Square: 48916036

Square Root: 83.6301381082203

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 1 / (1 + ∑_k>=1 λ(k)*x^k), where λ() is the Liouville function (A008836). A356907

Generalized 22-gonal (or icosidigonal) numbers: m*(10·m - 9) with m = 0, +1, -1, +2, -2, +3, -3, ... A303299

Intrinsic 9-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base. A60879

T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..1 nXk array. A219519

3-almost primes with semiprime digits (digits 4, 6, 9 only). A111494

a(n)=ceiling( ∑_i=1..n-1 a(i)/6), a(1)=1. A120178

T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 3 or 4. A252075

Numbers n such that n!8-1 is prime. A204662

Octo numbers (a polygonal sequence): a(n) = 5·n² - 6·n + 2 = (n-1)² + (2·n-1)². A79273

A triangle formed like Pascal's triangle, but with factorial(n) on the borders instead of 1. A227550