ℕ atory
Play Now

Properties of the Number -100100

One Hundred Thousand One Hundred

Basics

Value: -100101 → -100100 → -100099

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 2

Digital Root: 2

Palindrome: No

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

Divisors: 1, 2, 4, 5, 7, 10, 11, 13, 14, 20

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: -11000011100000100

Octal: -303404

Duodecimal: -49B18

Hexadecimal: -18704

Square: 10020010000

Square Root: 316.3858403911275

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

Square array read by ascending antidiagonals: T(n,k) = [xk] (1 - x)2·k * LegendreP(n·k-1, (1 + x)/(1 - x)) for n, k >= 0. A364513
a(0) = 1 and a(n) = [xn] (1 - x)2·n * LegendreP(n-1, (1 + x)/(1 - x)) for n >= 1. A364514
The binary numbers (or binary words, or binary vectors, or binary expansion of n): numbers written in base 2. A7088
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
Least positive multiple of n that when written in base 10 uses only 0's and 1's. A4290
Binary vectors not containing three consecutive 1's; or, representation of n in the tribonacci base. A278038
Sums of 2 distinct powers of 10. A38444
Smallest multiple of n with digit sum = 2, or 0 if no such number exists, e.g., a(3k)=0. A69521
Multiples of 2 whose digit sum is 2. A69537