Properties of the Number -42094

Forty-Two Thousand Ninety-Four

Basics

Value: -42095 → -42094 → -42093

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 13 × 1619

Divisors: 1, 2, 13, 26, 1619, 3238, 21047, 42094

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1010010001101110

Octal: -122156

Duodecimal: -2043A

Hexadecimal: -a46e

Square: 1771904836

Square Root: 205.16822366048794

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

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00000111. A260070

Convolution of Fibonacci and Jacobsthal numbers. A94687

a(n) = floor(log(n)*2ⁿ/n). A65613

a(n) = round(log(n)*2ⁿ/n). A65614

Number of 6-step S, NW and NE-moving king's tours on an n X n board summed over all starting positions. A187380

Number of (n+2)X(3+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00000111. A260065

Number of (n+2)X(7+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00000111. A260069

a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 3, where m = 2·n - 3 - 2^p+1 and p is the unique integer such that 2^p < n-1 <= 2^p+1, with a(1) = a(2) = 1. A49884

Indices of triple-safe primes: p=prime(n) is double-safe: q=(p-1)/2, r=(q-1)/2 and s=(r-1)/2 are all prime (and q is double-safe). A75134