Base | Representation |
---|---|
bin | 101101110000001000110100… |
… | …101001000100111111110001 |
3 | 222101110110020210220211101211 |
4 | 231300020310221010333301 |
5 | 202333242231324014301 |
6 | 1551543123244200121 |
7 | 60245446453566562 |
oct | 5560106451047761 |
9 | 871413223824354 |
10 | 201220101001201 |
11 | 59129a69244127 |
12 | 1a699978839041 |
13 | 8837c88155929 |
14 | 3799167a06169 |
15 | 183e2e37e7051 |
hex | b70234a44ff1 |
201220101001201 has 2 divisors, whose sum is σ = 201220101001202. Its totient is φ = 201220101001200.
The previous prime is 201220101001181. The next prime is 201220101001219. The reversal of 201220101001201 is 102100101022102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 200435372550400 + 784728450801 = 14157520^2 + 885849^2 .
It is a cyclic number.
It is not a de Polignac number, because 201220101001201 - 29 = 201220101000689 is a prime.
It is not a weakly prime, because it can be changed into another prime (201220101001001) 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, 100610050500600 + 100610050500601.
It is an arithmetic number, because the mean of its divisors is an integer number (100610050500601).
Almost surely, 2201220101001201 is an apocalyptic number.
It is an amenable number.
201220101001201 is a deficient number, since it is larger than the sum of its proper divisors (1).
201220101001201 is an equidigital number, since it uses as much as digits as its factorization.
201220101001201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 201220101001201 its reverse (102100101022102), we get a palindrome (303320202023303).
The spelling of 201220101001201 in words is "two hundred one trillion, two hundred twenty billion, one hundred one million, one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •