Search a number
-
+
2011032301111 is a prime number
BaseRepresentation
bin11101010000111010110…
…111011010111000110111
321010020211022001210222221
4131100322313122320313
5230422043232113421
64135504441303211
7265202153342161
oct35207267327067
97106738053887
102011032301111
11705968340a09
12285902794b07
1311784108b1b2
146d497b6b931
15374a17ec841
hex1d43addae37

2011032301111 has 2 divisors, whose sum is σ = 2011032301112. Its totient is φ = 2011032301110.

The previous prime is 2011032301063. The next prime is 2011032301133. The reversal of 2011032301111 is 1111032301102.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-2011032301111 is a prime.

It is a super-2 number, since 2×20110323011112 (a number of 25 digits) contains 22 as substring.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (2011032301211) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005516150555 + 1005516150556.

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

Almost surely, 22011032301111 is an apocalyptic number.

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

2011032301111 is an equidigital number, since it uses as much as digits as its factorization.

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

The product of its (nonzero) digits is 36, while the sum is 16.

Adding to 2011032301111 its reverse (1111032301102), we get a palindrome (3122064602213).

Subtracting from 2011032301111 its reverse (1111032301102), we obtain a palindrome (900000000009).

The spelling of 2011032301111 in words is "two trillion, eleven billion, thirty-two million, three hundred one thousand, one hundred eleven".