Properties of the Number -11101100

Eleven Million One Hundred One Thousand One Hundred

Basics

Value: -11101101 → -11101100 → -11101099

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 5

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 5 ² × 31 × 3581

Divisors: 1, 2, 4, 5, 10, 20, 25, 31, 50, 62

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: -101010010110001110101100

Octal: -52261654

Duodecimal: -38742B8

Hexadecimal: -a963ac

Square: 123234421210000

Square Root: 3331.8313282637823

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

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 369", based on the 5-celled von Neumann neighborhood. A281514

Binary representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 177", based on the 5-celled von Neumann neighborhood. A286200

Binary representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 462", based on the 5-celled von Neumann neighborhood. A288435

a(n) = binary odd/even encoding of the iterates in the modified Syracuse algorithm (msa) starting with 2n+1 and continuing up to (but not including) the first iterate less than 2n+1. A260592

Let a(n) be the sequence of 0's and 1's that represents n. Then a(0) = 0; and a((1b)_2) = 1a(|b|)b where |b| denotes the length of b. A290155