Base | Representation |
---|---|
bin | 1011101100110111011… |
… | …0100000000111001001 |
3 | 201012212120120100211212 |
4 | 2323031312200013021 |
5 | 11243143130042301 |
6 | 232203121302505 |
7 | 20344341521651 |
oct | 2731566400711 |
9 | 635776510755 |
10 | 201022112201 |
11 | 78286818229 |
12 | 32b61a94a35 |
13 | 15c57ccbcb1 |
14 | 9a2db47361 |
15 | 53680724bb |
hex | 2ecdda01c9 |
201022112201 has 2 divisors, whose sum is σ = 201022112202. Its totient is φ = 201022112200.
The previous prime is 201022112191. The next prime is 201022112219. The reversal of 201022112201 is 102211220102.
201022112201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 199006102201 + 2016010000 = 446101^2 + 44900^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201022112201 is a prime.
It is not a weakly prime, because it can be changed into another prime (201022118201) 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, 100511056100 + 100511056101.
It is an arithmetic number, because the mean of its divisors is an integer number (100511056101).
Almost surely, 2201022112201 is an apocalyptic number.
It is an amenable number.
201022112201 is a deficient number, since it is larger than the sum of its proper divisors (1).
201022112201 is an equidigital number, since it uses as much as digits as its factorization.
201022112201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 201022112201 its reverse (102211220102), we get a palindrome (303233332303).
The spelling of 201022112201 in words is "two hundred one billion, twenty-two million, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •