Base | Representation |
---|---|
bin | 11001000000110111101111… |
… | …001111001111000110101011 |
3 | 112102111221122111212200012022 |
4 | 121000313233033033012223 |
5 | 103404410022320213344 |
6 | 1025550205533535055 |
7 | 32113014260366243 |
oct | 3100675717170653 |
9 | 472457574780168 |
10 | 110011011101099 |
11 | 32064453870449 |
12 | 10408a5504448b |
13 | 494ccbc5b48b4 |
14 | 1d247c04a0b23 |
15 | cab98b2460ee |
hex | 640def3cf1ab |
110011011101099 has 2 divisors, whose sum is σ = 110011011101100. Its totient is φ = 110011011101098.
The previous prime is 110011011101051. The next prime is 110011011101141. The reversal of 110011011101099 is 990101110110011.
It is a strong prime.
It is an emirp because it is prime and its reverse (990101110110011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110011011101099 - 28 = 110011011100843 is a prime.
It is a super-2 number, since 2×1100110111010992 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (110011011101029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55005505550549 + 55005505550550.
It is an arithmetic number, because the mean of its divisors is an integer number (55005505550550).
Almost surely, 2110011011101099 is an apocalyptic number.
110011011101099 is a deficient number, since it is larger than the sum of its proper divisors (1).
110011011101099 is an equidigital number, since it uses as much as digits as its factorization.
110011011101099 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 26.
The spelling of 110011011101099 in words is "one hundred ten trillion, eleven billion, eleven million, one hundred one thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •