Search a number
-
+
200001011211002 = 2100000505605501
BaseRepresentation
bin101101011110011001011101…
…001110100101101011111010
3222020010220120100101220021202
4231132121131032211223322
5202203304032332223002
61545211110211134202
760061411334420531
oct5536313516455372
9866126510356252
10200001011211002
11587a9a528a4121
121a521651ba4362
13877a025922ba1
14375615a04d318
15181c742c37502
hexb5e65d3a5afa

200001011211002 has 4 divisors (see below), whose sum is σ = 300001516816506. Its totient is φ = 100000505605500.

The previous prime is 200001011210993. The next prime is 200001011211041. The reversal of 200001011211002 is 200112110100002.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in only one way, i.e., 177552187166641 + 22448824044361 = 13324871^2 + 4738019^2 .

It is an unprimeable number.

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

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

Almost surely, 2200001011211002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 100000505605503.

The product of its (nonzero) digits is 8, while the sum is 11.

Adding to 200001011211002 its reverse (200112110100002), we get a palindrome (400113121311004).

The spelling of 200001011211002 in words is "two hundred trillion, one billion, eleven million, two hundred eleven thousand, two".

Divisors: 1 2 100000505605501 200001011211002