Base | Representation |
---|---|
bin | 101101101101000110001011… |
… | …110100000110011100110011 |
3 | 222100201110210212200121020001 |
4 | 231231012023310012130303 |
5 | 202321331223142023102 |
6 | 1551303121300130431 |
7 | 60224400460413016 |
oct | 5555061364063463 |
9 | 870643725617201 |
10 | 201011110111027 |
11 | 59059373344087 |
12 | 1a665372096a17 |
13 | 8821360225ac8 |
14 | 378cdbd80137d |
15 | 1838b60d95487 |
hex | b6d18bd06733 |
201011110111027 has 2 divisors, whose sum is σ = 201011110111028. Its totient is φ = 201011110111026.
The previous prime is 201011110110973. The next prime is 201011110111037. The reversal of 201011110111027 is 720111011110102.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201011110111027 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201011110110995 and 201011110111013.
It is not a weakly prime, because it can be changed into another prime (201011110111037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100505555055513 + 100505555055514.
It is an arithmetic number, because the mean of its divisors is an integer number (100505555055514).
Almost surely, 2201011110111027 is an apocalyptic number.
201011110111027 is a deficient number, since it is larger than the sum of its proper divisors (1).
201011110111027 is an equidigital number, since it uses as much as digits as its factorization.
201011110111027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28, while the sum is 19.
Adding to 201011110111027 its reverse (720111011110102), we get a palindrome (921122121221129).
The spelling of 201011110111027 in words is "two hundred one trillion, eleven billion, one hundred ten million, one hundred eleven thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •