Base | Representation |
---|---|
bin | 101101110000001010110010… |
… | …010110101100001001001101 |
3 | 222101110122200210120122210121 |
4 | 231300022302112230021031 |
5 | 202333311041242010104 |
6 | 1551544112425504541 |
7 | 60245552643662113 |
oct | 5560126226541115 |
9 | 871418623518717 |
10 | 201222210110029 |
11 | 5912a950833879 |
12 | 1a69a267042151 |
13 | 88382330b2814 |
14 | 37992c7b83ab3 |
15 | 183e3b8a5d254 |
hex | b702b25ac24d |
201222210110029 has 2 divisors, whose sum is σ = 201222210110030. Its totient is φ = 201222210110028.
The previous prime is 201222210110023. The next prime is 201222210110123. The reversal of 201222210110029 is 920011012222102.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 185529734064900 + 15692476045129 = 13620930^2 + 3961373^2 .
It is a cyclic number.
It is not a de Polignac number, because 201222210110029 - 23 = 201222210110021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201222210109985 and 201222210110012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201222210110021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100611105055014 + 100611105055015.
It is an arithmetic number, because the mean of its divisors is an integer number (100611105055015).
Almost surely, 2201222210110029 is an apocalyptic number.
It is an amenable number.
201222210110029 is a deficient number, since it is larger than the sum of its proper divisors (1).
201222210110029 is an equidigital number, since it uses as much as digits as its factorization.
201222210110029 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 25.
The spelling of 201222210110029 in words is "two hundred one trillion, two hundred twenty-two billion, two hundred ten million, one hundred ten thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •