Search a number
-
+
201010100111 = 1011990199011
BaseRepresentation
bin1011101100110100100…
…0101011011110001111
3201012211201222002100122
42323031020223132033
511243132041200421
6232202012015155
720344134442202
oct2731510533617
9635751862318
10201010100111
117827aa63387
1232b59a614bb
1315c55684652
149a2c2db939
155366e9d2ab
hex2ecd22b78f

201010100111 has 4 divisors (see below), whose sum is σ = 203000299224. Its totient is φ = 199019901000.

The previous prime is 201010100101. The next prime is 201010100117. The reversal of 201010100111 is 111001010102.

It is a happy number.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 201010100111 - 214 = 201010083727 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (201010100117) 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, 995099405 + ... + 995099606.

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

Almost surely, 2201010100111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1990199112.

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

Adding to 201010100111 its reverse (111001010102), we get a palindrome (312011110213).

Subtracting from 201010100111 its reverse (111001010102), we obtain a palindrome (90009090009).

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

Divisors: 1 101 1990199011 201010100111