Base | Representation |
---|---|
bin | 1011101101001100101… |
… | …0000010110010011011 |
3 | 201020002210001111000221 |
4 | 2323103022002302123 |
5 | 11243333421333201 |
6 | 232220021140511 |
7 | 20346502215661 |
oct | 2732312026233 |
9 | 636083044027 |
10 | 201111121051 |
11 | 78321a91965 |
12 | 32b8785a737 |
13 | 15c70594a59 |
14 | 9a3b8b6c31 |
15 | 5370ca54a1 |
hex | 2ed3282c9b |
201111121051 has 2 divisors, whose sum is σ = 201111121052. Its totient is φ = 201111121050.
The previous prime is 201111121033. The next prime is 201111121061. The reversal of 201111121051 is 150121111102.
201111121051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201111121051 - 27 = 201111120923 is a prime.
It is not a weakly prime, because it can be changed into another prime (201111121061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100555560525 + 100555560526.
It is an arithmetic number, because the mean of its divisors is an integer number (100555560526).
Almost surely, 2201111121051 is an apocalyptic number.
201111121051 is a deficient number, since it is larger than the sum of its proper divisors (1).
201111121051 is an equidigital number, since it uses as much as digits as its factorization.
201111121051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20, while the sum is 16.
Adding to 201111121051 its reverse (150121111102), we get a palindrome (351232232153).
The spelling of 201111121051 in words is "two hundred one billion, one hundred eleven million, one hundred twenty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •