Base | Representation |
---|---|
bin | 11101000111101011011… |
… | …100111000110100000101 |
3 | 21002022012210112020222211 |
4 | 131013223130320310011 |
5 | 230241233130324031 |
6 | 4131144112223421 |
7 | 264401241305113 |
oct | 35075334706405 |
9 | 7068183466884 |
10 | 2001110011141 |
11 | 70173648366a |
12 | 2839b383ab71 |
13 | 11691c50b9b7 |
14 | 6cbd6076ab3 |
15 | 370c068ebb1 |
hex | 1d1eb738d05 |
2001110011141 has 2 divisors, whose sum is σ = 2001110011142. Its totient is φ = 2001110011140.
The previous prime is 2001110011091. The next prime is 2001110011151. The reversal of 2001110011141 is 1411100111002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1380566250625 + 620543760516 = 1174975^2 + 787746^2 .
It is a cyclic number.
It is not a de Polignac number, because 2001110011141 - 221 = 2001107913989 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2001110011151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000555005570 + 1000555005571.
It is an arithmetic number, because the mean of its divisors is an integer number (1000555005571).
Almost surely, 22001110011141 is an apocalyptic number.
It is an amenable number.
2001110011141 is a deficient number, since it is larger than the sum of its proper divisors (1).
2001110011141 is an equidigital number, since it uses as much as digits as its factorization.
2001110011141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 2001110011141 its reverse (1411100111002), we get a palindrome (3412210122143).
The spelling of 2001110011141 in words is "two trillion, one billion, one hundred ten million, eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •