Search a number
-
+
2000100002 = 21000050001
BaseRepresentation
bin111011100110111…
…0001101010100010
312011101112121101212
41313031301222202
513044011200002
6530245030122
7100364366225
oct16715615242
95141477355
102000100002
1193700580a
124799b5342
1325b4b0a34
1414d8c35bc
15ba8d2352
hex77371aa2

2000100002 has 4 divisors (see below), whose sum is σ = 3000150006. Its totient is φ = 1000050000.

The previous prime is 2000099957. The next prime is 2000100097. The reversal of 2000100002 is 2000010002.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 2000010002 = 21000005001.

It can be written as a sum of positive squares in only one way, i.e., 1387488001 + 612612001 = 37249^2 + 24751^2 .

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500024999 + ... + 500025002.

Almost surely, 22000100002 is an apocalyptic number.

2000100002 is a deficient number, since it is larger than the sum of its proper divisors (1000050004).

2000100002 is a wasteful number, since it uses less digits than its factorization.

2000100002 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 1000050003.

The product of its (nonzero) digits is 4, while the sum is 5.

The square root of 2000100002 is about 44722.4775923696. The cubic root of 2000100002 is about 1259.9420486490.

Adding to 2000100002 its reverse (2000010002), we get a palindrome (4000110004).

Subtracting from 2000100002 its reverse (2000010002), we obtain a square (90000 = 3002).

It can be divided in two parts, 200010000 and 2, that added together give a palindrome (200010002).

The spelling of 2000100002 in words is "two billion, one hundred thousand, two".

Divisors: 1 2 1000050001 2000100002