Properties of the Number -10010110

Ten Million Ten Thousand One Hundred Ten

Basics

Value: -10010111 → -10010110 → -10010109

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 4

Digital Root: 4

Palindrome: No

Factorization: 2 × 5 × 11 × 17 × 53 × 101

Divisors: 1, 2, 5, 10, 11, 17, 22, 34, 53, 55

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: -100110001011110111111110

Octal: -46136776

Duodecimal: -3428A7A

Hexadecimal: -98bdfe

Square: 100202302212100

Square Root: 3163.8757877009016

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

Digitally balanced numbers: binary numbers which have the same number of 0's as 1's; decimal representation: A031443. A71925

Consider numbers m in the range 2ⁿ <= m < 2ⁿ⁺¹; the smallest A215244(m) in this range is k=A215245(n); a(n) = binary representation of m for the first time this k appears. A215254

Binary words beginning with 1 which are abelian squares. A272654

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

Even numbers n (written in binary) such that in base-2 lunar arithmetic, the sum of the divisors of n is a number containing a 0 (in binary). A190149

Reverse and add (in binary). A35526

a(n) = concatenation of first n elements of Thue-Morse sequence A010059. A102397

Binary expansion of n followed by its reverse complement. A66489

Sequence of balanced, multiplicative binary words, starting with a(1)=1, a(2)=10; for j > 2, if j is a prime, then a(j) is obtained by appending 0 at the end of a(j-1); otherwise, a(j) is obtained by appending a single digit at the end of a(j-1) such that the new word is multiplicative, but if the obtained a(j) is not balanced, then we change the digit at the rightmost possible prime position (and, eventually, some digits at following nonprime positions to maintain multiplicativity) so that a(j) becomes balanced. A351386