Properties of the Number -101011

One Hundred One Thousand Eleven

Basics

Value: -101012 → -101011 → -101010

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 4

Digital Root: 4

Palindrome: No

Factorization: 83 × 1217

Divisors: 1, 83, 1217, 101011

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: -11000101010010011

Octal: -305223

Duodecimal: -4A557

Hexadecimal: -18a93

Square: 10203222121

Square Root: 317.822277381558

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

Primes written in base 2. A4676

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

a(n) is the maximal (or lazy) tribonacci representation of n using a binary system of vectors not containing three consecutive 0's. A352103

Sums of 4 distinct powers of 10. A38446

Numbers k such that k and k² use only the digits 0, 1, 2 and 3. A136809

Binary numbers that represent irreducible polynomials over the rationals with coefficients restricted to {0,1}. A206073

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

Coefficients of monic primitive irreducible polynomials over GF(3) listed in lexicographic order. A58949