Base | Representation |
---|---|
bin | 10000001010110010111… |
… | …001110110011101101111 |
3 | 10221012221200110021022202 |
4 | 100022302321312131233 |
5 | 121201014341301421 |
6 | 2210233402532115 |
7 | 143163112166114 |
oct | 20126271663557 |
9 | 3835850407282 |
10 | 1111103072111 |
11 | 39924179944a |
12 | 15b40a20703b |
13 | 80a13180826 |
14 | 3bac5d2890b |
15 | 1dd8060010b |
hex | 102b2e7676f |
1111103072111 has 2 divisors, whose sum is σ = 1111103072112. Its totient is φ = 1111103072110.
The previous prime is 1111103072099. The next prime is 1111103072113. The reversal of 1111103072111 is 1112703011111.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1111103072111 is a prime.
Together with 1111103072113, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1111103072113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555551536055 + 555551536056.
It is an arithmetic number, because the mean of its divisors is an integer number (555551536056).
Almost surely, 21111103072111 is an apocalyptic number.
1111103072111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1111103072111 is an equidigital number, since it uses as much as digits as its factorization.
1111103072111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42, while the sum is 20.
Adding to 1111103072111 its reverse (1112703011111), we get a palindrome (2223806083222).
The spelling of 1111103072111 in words is "one trillion, one hundred eleven billion, one hundred three million, seventy-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •