Search a number
-
+
2000201120111 = 15712740134523
BaseRepresentation
bin11101000110110101010…
…001101111100101101111
321002012212110021210220002
4131012311101233211233
5230232402441320421
64130514003414515
7264336563666045
oct35066521574557
97065773253802
102000201120111
1170130a429357
1228379b38443b
1311680612145c
146cb4b484395
153706a9a8b0b
hex1d1b546f96f

2000201120111 has 4 divisors (see below), whose sum is σ = 2012941254792. Its totient is φ = 1987460985432.

The previous prime is 2000201120101. The next prime is 2000201120131. The reversal of 2000201120111 is 1110211020002.

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 2000201120111 - 226 = 2000134011247 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

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

Almost surely, 22000201120111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 12740134680.

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

Adding to 2000201120111 its reverse (1110211020002), we get a palindrome (3110412140113).

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

Divisors: 1 157 12740134523 2000201120111