Properties of the Number -110110

One Hundred Ten Thousand One Hundred Ten

Basics

Value: -110111 → -110110 → -110109

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 4

Digital Root: 4

Palindrome: No

Factorization: 2 × 5 × 7 × 11 ² × 13

Divisors: 1, 2, 5, 7, 10, 11, 13, 14, 22, 26

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: -11010111000011110

Octal: -327036

Duodecimal: -5387A

Hexadecimal: -1ae1e

Square: 12124212100

Square Root: 331.82826883796383

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

Dual Zeckendorf representation of n or the maximal (binary) Fibonacci representation. Also list of binary vectors not containing 00. A104326

Binary vectors not containing three consecutive 1's; or, representation of n in the tribonacci base. A278038

Binary reflected Gray code. A14550

Sums of 4 distinct powers of 10. A38446

Maximal (or "lazy") Lucas representation of n. Binary system for representing integers using Lucas numbers (A000032) as a base. A130311

Working in base 2: a(0)=0, thereafter a(n+1) is the smallest number not already in the sequence such that the bits of a(n) and a(n+1) together can be rearranged to form a palindrome. A230891

Negative numbers in base -2. A212529

Decimal expansion of a(n) is given by the first n terms of the periodic sequence with initial period 1,1,0. A33137

a(n) = {n concatenate R(n)}*{ R(n) concatenate n}, where R(n) = digit reversal of n. A110722

Expansion of f(q) * f(q⁵) / φ(-q²)² in powers of q where f(), φ() are Ramanujan θ functions. A145722