Search a number
-
+
200110020111 = 3223966715073
BaseRepresentation
bin1011101001011101111…
…1001001011000001111
3201010112000022021201100
42322113133021120033
511234311131120421
6231532420114143
720312625051231
oct2722737113017
9633460267640
10200110020111
1177958986a11
1232948535953
1315b41060731
149984960251
155312e57c26
hex2e977c960f

200110020111 has 12 divisors (see below), whose sum is σ = 301615103088. Its totient is φ = 127606389504.

The previous prime is 200110020053. The next prime is 200110020119. The reversal of 200110020111 is 111020011002.

It is a happy number.

It is not a de Polignac number, because 200110020111 - 213 = 200110011919 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

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

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 483357330 + ... + 483357743.

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

Almost surely, 2200110020111 is an apocalyptic number.

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

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

200110020111 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 966715102 (or 966715099 counting only the distinct ones).

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

Adding to 200110020111 its reverse (111020011002), we get a palindrome (311130031113).

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

Divisors: 1 3 9 23 69 207 966715073 2900145219 8700435657 22234446679 66703340037 200110020111