Properties of the Number -8942

Nine Hundred Forty-Two

Basics

Value: -8943 → -8942 → -8941

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 × 17 × 263

Divisors: 1, 2, 17, 34, 263, 526, 4471, 8942

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10001011101110

Octal: -21356

Duodecimal: -5212

Hexadecimal: -22ee

Square: 79959364

Square Root: 94.56214887575261

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

Values of L(2ⁿ), where L(n) is the summatory function of the Liouville function A008836(n). A390483

Twice-partitioned numbers where the first partition is constant. A279787

Triangle T(n,k) giving number of Dyck paths of length 2n with exactly k hills (0 <= k <= n). A65600

Number of Q₂-isomorphism classes of fields of degree n in the algebraic closure of Q₂. A100983

Number of edges in a regular drawing of a complete bipartite graph where the vertex positions on each part equal the Farey series of order n. A359693

Positions of 3's in A234323. A234804

Numbers k such that k and 8·k, taken together, are zeroless pandigital. A115932

a(n)/2^n-1 is the expected win if one of two baskets is chosen randomly and the player optimally chooses the coins with values from 1 to n (see Comments for details). A391791

Number of Dyck paths of length 2n with exactly 2 hills. A294527

Triangle T(n,k) is the number of restricted growth strings (RGS) of set partitions of {1..n} that have an increase at index k (1<=k<n). A56861