Properties of the Number -1000100

One Hundred

Basics

Value: -1000101 → -1000100 → -1000099

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 2

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 5 ² × 73 × 137

Divisors: 1, 2, 4, 5, 10, 20, 25, 50, 73, 100

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: -11110100001010100100

Octal: -3641244

Duodecimal: -402918

Hexadecimal: -f42a4

Square: 1000200010000

Square Root: 1000.0499987500625

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

Representation of n in base of Fibonacci numbers (the Zeckendorf representation of n). Also, binary words starting with 1 not containing 11, with the word 0 added. A14417

Sums of two powers of 10. A52216

Sums of 2 distinct powers of 10. A38444

Multiples of 2 whose digit sum is 2. A69537

The part of n in base φ left of the decimal point, using a greedy algorithm representation (more precisely, using the Bergman-canonical representation). A105424

Minimal (or "greedy") Lucas representation of n, in which L(0) = 2 and L(2) = 3 are not allowed in the same representation (hence the correct representation of the integer 5 is 1010 rather than 101). A binary system of integers with Lucas numbers (A000032) as a base. A130310

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

NegaFibonacci representation code for n. A215022

A048715, written in binary. A350215

The number n written using the greedy algorithm in the base where the values of the places are 1 and primes. A7924