Search a number
-
+
200211020101010 = 2520021102010101
BaseRepresentation
bin101101100001011101000010…
…101110111011010110010010
3222020212222122020011212201002
4231201131002232323112102
5202220224132121213020
61545451401202342002
760112524501504062
oct5541350256732622
9866788566155632
10200211020101010
11588800203a1546
121a5562a165a902
138793a83722a89
14376239d5293a2
151822e34c23975
hexb61742bbb592

200211020101010 has 8 divisors (see below), whose sum is σ = 360379836181836. Its totient is φ = 80084408040400.

The previous prime is 200211020101003. The next prime is 200211020101019. The reversal of 200211020101010 is 10101020112002.

It can be written as a sum of positive squares in 2 ways, for example, as 170812274613289 + 29398745487721 = 13069517^2 + 5422061^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

It is a junction number, because it is equal to n+sod(n) for n = 200211020100982 and 200211020101000.

It is not an unprimeable number, because it can be changed into a prime (200211020101019) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10010551005041 + ... + 10010551005060.

Almost surely, 2200211020101010 is an apocalyptic number.

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

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

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

The sum of its prime factors is 20021102010108.

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

Adding to 200211020101010 its reverse (10101020112002), we get a palindrome (210312040213012).

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

Divisors: 1 2 5 10 20021102010101 40042204020202 100105510050505 200211020101010