Base | Representation |
---|---|
bin | 10000000001011111010… |
… | …101001000000000110011 |
3 | 10220021011022121110210002 |
4 | 100001133111020000303 |
5 | 121020033404014024 |
6 | 2201502102100215 |
7 | 142360362036632 |
oct | 20013725100063 |
9 | 3807138543702 |
10 | 1101111001139 |
11 | 394a844aa656 |
12 | 15949ba1a66b |
13 | 7cab000b3b6 |
14 | 3b418c6b519 |
15 | 1d9982ab6ae |
hex | 1005f548033 |
1101111001139 has 2 divisors, whose sum is σ = 1101111001140. Its totient is φ = 1101111001138.
The previous prime is 1101111001099. The next prime is 1101111001147. The reversal of 1101111001139 is 9311001111011.
It is a strong prime.
It is an emirp because it is prime and its reverse (9311001111011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1101111001139 - 212 = 1101110997043 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1101111001139.
It is not a weakly prime, because it can be changed into another prime (1101111021139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550555500569 + 550555500570.
It is an arithmetic number, because the mean of its divisors is an integer number (550555500570).
Almost surely, 21101111001139 is an apocalyptic number.
1101111001139 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101111001139 is an equidigital number, since it uses as much as digits as its factorization.
1101111001139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 20.
The spelling of 1101111001139 in words is "one trillion, one hundred one billion, one hundred eleven million, one thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •