ℕ atory
Play Now

Properties of the Number -100000002

One Hundred Million Two

Basics

Value: -100000003 → -100000002 → -100000001

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 3

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 19 × 739 × 1187

Divisors: 1, 2, 3, 6, 19, 38, 57, 114, 739, 1187

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -101111101011110000100000010

Octal: -575360402

Duodecimal: -295A6456

Hexadecimal: -5f5e102

Square: 10000000400000004

Square Root: 10000.0001

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

Numbers with n 0's between 1 and 2. A133384
a(n) = smallest number that leads to a new cycle under the Kaprekar map of A151949. A151964
Numbers k such that k concatenated with k-6 gives the product of two numbers which differ by 5. A116118
Numbers k such that k2 contains only digits {0,1,4}, not ending with zero. A58413
Lexicographically earliest strictly increasing base 3 autovarious sequence: a(n) = number of distinct a(k) mod 3n (written in base 3). A37091
Integers k < (reversal of k) such that (reversal of k) + 1 is divisible by k-1. A52148
a(1) = 2, then the smallest squarefree number greater than the previous term that begins with the end of the previous term. A77209
Smallest decimal number containing n palindromic substrings (Version 2). See Comments for precise definition. A361336
Concatenate the positions of digits 0, 1, ..., 9 in the decimal representation of n, using 1 for the leftmost digit etc., and 0 when the digit does not occur. A260520
Lexicographically earliest sequence of distinct positive terms such that the digitsum of a(n) is the length of a(n+1). A332701