Search a number
-
+
200211001011110 = 2531763158044483
BaseRepresentation
bin101101100001011101000001…
…100110000110101110100110
3222020212222120220021000021202
4231201131001212012232212
5202220224112224323420
61545451355241242502
760112524150315305
oct5541350146065646
9866788526230252
10200211001011110
1158880010642a71
121a556297193432
138793a7c79a98b
14376239ab9a43c
151822e33202575
hexb61741986ba6

200211001011110 has 16 divisors (see below), whose sum is σ = 361516646626416. Its totient is φ = 79831768225248.

The previous prime is 200211001011053. The next prime is 200211001011121. The reversal of 200211001011110 is 11110100112002.

It is a Curzon number.

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

It is a congruent number.

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 in 7 ways as a sum of consecutive naturals, for example, 31579019072 + ... + 31579025411.

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

Almost surely, 2200211001011110 is an apocalyptic number.

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

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

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

The sum of its prime factors is 63158044807.

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

Adding to 200211001011110 its reverse (11110100112002), we get a palindrome (211321101123112).

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

Divisors: 1 2 5 10 317 634 1585 3170 63158044483 126316088966 315790222415 631580444830 20021100101111 40042200202222 100105500505555 200211001011110