Base | Representation |
---|---|
bin | 10000000001011001010… |
… | …111101110100101001111 |
3 | 10220020220100110220121001 |
4 | 100001121113232211033 |
5 | 121014332310120421 |
6 | 2201444131121131 |
7 | 142355036154022 |
oct | 20013127564517 |
9 | 3806810426531 |
10 | 1101011020111 |
11 | 394a33021402 |
12 | 1594724431a7 |
13 | 7ca953a3422 |
14 | 3b4098831b9 |
15 | 1d98e60c691 |
hex | 100595ee94f |
1101011020111 has 2 divisors, whose sum is σ = 1101011020112. Its totient is φ = 1101011020110.
The previous prime is 1101011020061. The next prime is 1101011020141. The reversal of 1101011020111 is 1110201101011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1101011020111 - 29 = 1101011019599 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101011020141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550505510055 + 550505510056.
It is an arithmetic number, because the mean of its divisors is an integer number (550505510056).
Almost surely, 21101011020111 is an apocalyptic number.
1101011020111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101011020111 is an equidigital number, since it uses as much as digits as its factorization.
1101011020111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 1101011020111 its reverse (1110201101011), we get a palindrome (2211212121122).
The spelling of 1101011020111 in words is "one trillion, one hundred one billion, eleven million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •