Base | Representation |
---|---|
bin | 1001001100100010011100… |
… | …1010111110000111111101 |
3 | 1022210121021200111210222101 |
4 | 2103020213022332013331 |
5 | 2311124322102431414 |
6 | 33300533422545101 |
7 | 2062332154446355 |
oct | 223104712760775 |
9 | 38717250453871 |
10 | 10111010202109 |
11 | 3249067735a03 |
12 | 11736b8a38191 |
13 | 584605a2514b |
14 | 26d538557b65 |
15 | 128025a84a74 |
hex | 932272be1fd |
10111010202109 has 2 divisors, whose sum is σ = 10111010202110. Its totient is φ = 10111010202108.
The previous prime is 10111010202019. The next prime is 10111010202133. The reversal of 10111010202109 is 90120201011101.
Together with previous prime (10111010202019) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8976525327225 + 1134484874884 = 2996085^2 + 1065122^2 .
It is an emirp because it is prime and its reverse (90120201011101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10111010202109 - 211 = 10111010200061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10111010202179) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055505101054 + 5055505101055.
It is an arithmetic number, because the mean of its divisors is an integer number (5055505101055).
Almost surely, 210111010202109 is an apocalyptic number.
It is an amenable number.
10111010202109 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111010202109 is an equidigital number, since it uses as much as digits as its factorization.
10111010202109 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 19.
The spelling of 10111010202109 in words is "ten trillion, one hundred eleven billion, ten million, two hundred two thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •