Base | Representation |
---|---|
bin | 1011101100110100100… |
… | …1001000110000111101 |
3 | 201012211202012011221102 |
4 | 2323031021020300331 |
5 | 11243132104020333 |
6 | 232202014342445 |
7 | 20344135452044 |
oct | 2731511106075 |
9 | 635752164842 |
10 | 201010220093 |
11 | 78280035541 |
12 | 32b59abaa25 |
13 | 15c556c7147 |
14 | 9a2c32d55b |
15 | 5366ec3ae8 |
hex | 2ecd248c3d |
201010220093 has 2 divisors, whose sum is σ = 201010220094. Its totient is φ = 201010220092.
The previous prime is 201010220077. The next prime is 201010220137. The reversal of 201010220093 is 390022010102.
201010220093 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., 184794235129 + 16215984964 = 429877^2 + 127342^2 .
It is a cyclic number.
It is not a de Polignac number, because 201010220093 - 24 = 201010220077 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201010220053) 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, 100505110046 + 100505110047.
It is an arithmetic number, because the mean of its divisors is an integer number (100505110047).
Almost surely, 2201010220093 is an apocalyptic number.
It is an amenable number.
201010220093 is a deficient number, since it is larger than the sum of its proper divisors (1).
201010220093 is an equidigital number, since it uses as much as digits as its factorization.
201010220093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 201010220093 its reverse (390022010102), we get a palindrome (591032230195).
The spelling of 201010220093 in words is "two hundred one billion, ten million, two hundred twenty thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •