Search a number
-
+
200211001011002 = 2100105500505501
BaseRepresentation
bin101101100001011101000001…
…100110000110101100111010
3222020212222120220021000010202
4231201131001212012230322
5202220224112224323002
61545451355241242202
760112524150315062
oct5541350146065472
9866788526230122
10200211001011002
1158880010642983
121a556297193362
138793a7c79a907
14376239ab9a3a2
151822e33202502
hexb61741986b3a

200211001011002 has 4 divisors (see below), whose sum is σ = 300316501516506. Its totient is φ = 100105500505500.

The previous prime is 200211001010939. The next prime is 200211001011011. The reversal of 200211001011002 is 200110100112002.

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., 180525531688441 + 19685469322561 = 13435979^2 + 4436831^2 .

It is a super-2 number, since 2×2002110010110022 (a number of 29 digits) contains 22 as substring.

It is an unprimeable number.

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

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

Almost surely, 2200211001011002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 100105500505503.

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

Adding to 200211001011002 its reverse (200110100112002), we get a palindrome (400321101123004).

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

Divisors: 1 2 100105500505501 200211001011002