Base | Representation |
---|---|
bin | 101101110000001010110010… |
… | …010110101100001010101011 |
3 | 222101110122200210120122221002 |
4 | 231300022302112230022223 |
5 | 202333311041242010443 |
6 | 1551544112425505215 |
7 | 60245552643662306 |
oct | 5560126226541253 |
9 | 871418623518832 |
10 | 201222210110123 |
11 | 5912a950833954 |
12 | 1a69a26704220b |
13 | 88382330b2887 |
14 | 37992c7b83b3d |
15 | 183e3b8a5d2b8 |
hex | b702b25ac2ab |
201222210110123 has 2 divisors, whose sum is σ = 201222210110124. Its totient is φ = 201222210110122.
The previous prime is 201222210110029. The next prime is 201222210110153. The reversal of 201222210110123 is 321011012222102.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201222210110123 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201222210110095 and 201222210110104.
It is not a weakly prime, because it can be changed into another prime (201222210110153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100611105055061 + 100611105055062.
It is an arithmetic number, because the mean of its divisors is an integer number (100611105055062).
Almost surely, 2201222210110123 is an apocalyptic number.
201222210110123 is a deficient number, since it is larger than the sum of its proper divisors (1).
201222210110123 is an equidigital number, since it uses as much as digits as its factorization.
201222210110123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 201222210110123 its reverse (321011012222102), we get a palindrome (522233222332225).
The spelling of 201222210110123 in words is "two hundred one trillion, two hundred twenty-two billion, two hundred ten million, one hundred ten thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •