Properties of the Number -10943

Ten Thousand Nine Hundred Forty-Three

Basics

Value: -10944 → -10943 → -10942

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 31 × 353

Divisors: 1, 31, 353, 10943

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10101010111111

Octal: -25277

Duodecimal: -63BB

Hexadecimal: -2abf

Square: 119749249

Square Root: 104.60879504133484

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

Coefficients of the '6th-order' mock θ function λ(q). A53272

a(n) = Fibonacci(n) - 3. Number of total preorders. A6327

a(1)=3; for n > 1, a(n) = 1 + a(n-1) + gcd( a(n-1)*(a(n-1)+2), A073829(a(n-1)) ). A167053

Length of n-th iterate of the mapping 00->001, 1->10, as in A284932. A286938

G.f. A(x) satisfies: 1 = ∑_n>=0 xⁿ * ((1 + 4·x)ⁿ - A(x))ⁿ⁺¹, where A(0) = 0. A325584

Final members of groups in A076105. A76102

Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 43", based on the 5-celled von Neumann neighborhood. A278446

An "extremely strange sequence": a(n+1) = [ A·a(n)+B ]/p^r, where p^r is the highest power of p dividing [ A·a(n)+B ] and p=2, A=4.001, B=1.2. A28948

Number of binary strings of length n with no substrings equal to 0001, 0011, or 1010. A164457

Decimal representation of the n-th iteration of the "Rule 69" elementary cellular automaton starting with a single ON (black) cell. A266842