Base | Representation |
---|---|
bin | 101111110001100001001110… |
… | …101011101101010110010101 |
3 | 1000112221102112020010101210211 |
4 | 233301201032223231112111 |
5 | 210014430033232413414 |
6 | 2022511414402045421 |
7 | 62154012300053041 |
oct | 5761411653552625 |
9 | 1015842466111724 |
10 | 210111120201109 |
11 | 60a4769784a116 |
12 | 1b694b39049871 |
13 | 9031516a18a9a |
14 | 39c560aa13021 |
15 | 19457146013c4 |
hex | bf184eaed595 |
210111120201109 has 2 divisors, whose sum is σ = 210111120201110. Its totient is φ = 210111120201108.
The previous prime is 210111120201067. The next prime is 210111120201137. The reversal of 210111120201109 is 901102021111012.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 189870569098609 + 20240551102500 = 13779353^2 + 4498950^2 .
It is a cyclic number.
It is not a de Polignac number, because 210111120201109 - 27 = 210111120200981 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 210111120201109.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210111120201809) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105055560100554 + 105055560100555.
It is an arithmetic number, because the mean of its divisors is an integer number (105055560100555).
Almost surely, 2210111120201109 is an apocalyptic number.
It is an amenable number.
210111120201109 is a deficient number, since it is larger than the sum of its proper divisors (1).
210111120201109 is an equidigital number, since it uses as much as digits as its factorization.
210111120201109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 22.
The spelling of 210111120201109 in words is "two hundred ten trillion, one hundred eleven billion, one hundred twenty million, two hundred one thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •