Base | Representation |
---|---|
bin | 10000000000100011101… |
… | …110110101111110100011 |
3 | 10220011120122010202001211 |
4 | 100000203232311332203 |
5 | 121011011421010201 |
6 | 2201214543010551 |
7 | 142323531101362 |
oct | 20004356657643 |
9 | 3804518122054 |
10 | 1100111110051 |
11 | 394611050688 |
12 | 159260b99a57 |
13 | 7c980b0b975 |
14 | 3b36214b7d9 |
15 | 1d93a5ec651 |
hex | 10023bb5fa3 |
1100111110051 has 2 divisors, whose sum is σ = 1100111110052. Its totient is φ = 1100111110050.
The previous prime is 1100111109973. The next prime is 1100111110073. The reversal of 1100111110051 is 1500111110011.
It is a strong prime.
It is an emirp because it is prime and its reverse (1500111110011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1100111110051 is a prime.
It is not a weakly prime, because it can be changed into another prime (1100111110951) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550055555025 + 550055555026.
It is an arithmetic number, because the mean of its divisors is an integer number (550055555026).
Almost surely, 21100111110051 is an apocalyptic number.
1100111110051 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100111110051 is an equidigital number, since it uses as much as digits as its factorization.
1100111110051 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5, while the sum is 13.
Adding to 1100111110051 its reverse (1500111110011), we get a palindrome (2600222220062).
The spelling of 1100111110051 in words is "one trillion, one hundred billion, one hundred eleven million, one hundred ten thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •