Base | Representation |
---|---|
bin | 11001000010010101111000… |
… | …101111010000010100110111 |
3 | 112102212121120201122122201022 |
4 | 121002111320233100110313 |
5 | 103413034041132033421 |
6 | 1030104445035251355 |
7 | 32123223353624534 |
oct | 3102257057202467 |
9 | 472777521578638 |
10 | 110112102221111 |
11 | 320a330a0a6121 |
12 | 104245682a9b5b |
13 | 49596b0186183 |
14 | 1d296503cbd8b |
15 | cae4061607ab |
hex | 642578bd0537 |
110112102221111 has 2 divisors, whose sum is σ = 110112102221112. Its totient is φ = 110112102221110.
The previous prime is 110112102221059. The next prime is 110112102221131. The reversal of 110112102221111 is 111122201211011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110112102221111 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110112102221111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110112102221131) 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, 55056051110555 + 55056051110556.
It is an arithmetic number, because the mean of its divisors is an integer number (55056051110556).
Almost surely, 2110112102221111 is an apocalyptic number.
110112102221111 is a deficient number, since it is larger than the sum of its proper divisors (1).
110112102221111 is an equidigital number, since it uses as much as digits as its factorization.
110112102221111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 110112102221111 its reverse (111122201211011), we get a palindrome (221234303432122).
The spelling of 110112102221111 in words is "one hundred ten trillion, one hundred twelve billion, one hundred two million, two hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •