Base | Representation |
---|---|
bin | 101101101101000110001011… |
… | …001101111111101110000111 |
3 | 222100201110210011220002211202 |
4 | 231231012023031333232013 |
5 | 202321331213112400431 |
6 | 1551303120302053115 |
7 | 60224400306460325 |
oct | 5555061315775607 |
9 | 870643704802752 |
10 | 201011100121991 |
11 | 59059368741185 |
12 | 1a66536a87a19b |
13 | 882135b139233 |
14 | 378cdbc360d15 |
15 | 1838b600708cb |
hex | b6d18b37fb87 |
201011100121991 has 2 divisors, whose sum is σ = 201011100121992. Its totient is φ = 201011100121990.
The previous prime is 201011100121981. The next prime is 201011100122039. The reversal of 201011100121991 is 199121001110102.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201011100121991 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201011100121981) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100505550060995 + 100505550060996.
It is an arithmetic number, because the mean of its divisors is an integer number (100505550060996).
Almost surely, 2201011100121991 is an apocalyptic number.
201011100121991 is a deficient number, since it is larger than the sum of its proper divisors (1).
201011100121991 is an equidigital number, since it uses as much as digits as its factorization.
201011100121991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 29.
The spelling of 201011100121991 in words is "two hundred one trillion, eleven billion, one hundred million, one hundred twenty-one thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •