Base | Representation |
---|---|
bin | 101101110000001000110101… |
… | …001100001101101110011001 |
3 | 222101110110021110020210020021 |
4 | 231300020311030031232121 |
5 | 202333242241203240433 |
6 | 1551543124213430441 |
7 | 60245446625101315 |
oct | 5560106514155631 |
9 | 871413243223207 |
10 | 201220110211993 |
11 | 59129a73465354 |
12 | 1a69997b93b421 |
13 | 8837c8a02c1c2 |
14 | 3799168d22b45 |
15 | 183e2e451622d |
hex | b7023530db99 |
201220110211993 has 2 divisors, whose sum is σ = 201220110211994. Its totient is φ = 201220110211992.
The previous prime is 201220110211973. The next prime is 201220110212057. The reversal of 201220110211993 is 399112011022102.
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., 198962534846464 + 2257575365529 = 14105408^2 + 1502523^2 .
It is a cyclic number.
It is not a de Polignac number, because 201220110211993 - 29 = 201220110211481 is a prime.
It is not a weakly prime, because it can be changed into another prime (201220110211973) 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, 100610055105996 + 100610055105997.
It is an arithmetic number, because the mean of its divisors is an integer number (100610055105997).
Almost surely, 2201220110211993 is an apocalyptic number.
It is an amenable number.
201220110211993 is a deficient number, since it is larger than the sum of its proper divisors (1).
201220110211993 is an equidigital number, since it uses as much as digits as its factorization.
201220110211993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 34.
The spelling of 201220110211993 in words is "two hundred one trillion, two hundred twenty billion, one hundred ten million, two hundred eleven thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •