Properties of the Number -10101110

Ten Million One Hundred One Thousand One Hundred Ten

Basics

Value: -10101111 → -10101110 → -10101109

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 5

Digital Root: 5

Palindrome: No

Factorization: 2 × 5 × 163 × 6197

Divisors: 1, 2, 5, 10, 163, 326, 815, 1630, 6197, 12394

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: -100110100010000101110110

Octal: -46420566

Duodecimal: -3471672

Hexadecimal: -9a2176

Square: 102032423232100

Square Root: 3178.224347021462

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

Concatenate prime factorization as in A080670, but write everything in binary. A287874

Binary 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 457", based on the 5-celled von Neumann neighborhood. A282360

Binary representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 601", based on the 5-celled von Neumann neighborhood. A283218

Binary representation of the middle column of the "Rule 129" elementary cellular automaton starting with a single ON (black) cell. A267443

a(n) is the smallest number whose digits are 1's and 0's that cannot be written as a concatenation of any of the previous terms (not repeating any terms in the concatenation). a(0) = 0. A309870

a(n) = ∑_m=0..n 3^v3(m!), where v3(m!) is the exponent of the highest power of 3 dividing n!, expressed in base 3. A294493