Search a number
-
+
200211110222 = 2397092520979
BaseRepresentation
bin1011101001110110000…
…0110001100101001110
3201010210001112012021112
42322131200301211032
511240013021011342
6231550430532022
720315263233464
oct2723540614516
9633701465245
10200211110222
11779aaa52462
1232976367012
1315b58c96476
149994156834
15531bc75682
hex2e9d83194e

200211110222 has 8 divisors (see below), whose sum is σ = 300324347400. Its totient is φ = 100102994424.

The previous prime is 200211110191. The next prime is 200211110237. The reversal of 200211110222 is 222011112002.

200211110222 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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 = 200211110197 and 200211110206.

It is a congruent number.

It is an unprimeable number.

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

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

It is an arithmetic number, because the mean of its divisors is an integer number (37540543425).

Almost surely, 2200211110222 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2560690.

The product of its (nonzero) digits is 32, while the sum is 14.

Adding to 200211110222 its reverse (222011112002), we get a palindrome (422222222224).

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

Divisors: 1 2 39709 79418 2520979 5041958 100105555111 200211110222