Base | Representation |
---|---|
bin | 11001000000110111111010… |
… | …100000101000100010100111 |
3 | 112102111222010200201110100211 |
4 | 121000313322200220202213 |
5 | 103404410414223223421 |
6 | 1025550240411120251 |
7 | 32113022044656343 |
oct | 3100677240504247 |
9 | 472458120643324 |
10 | 110011200211111 |
11 | 32064540595611 |
12 | 10408aa8443087 |
13 | 495001c828204 |
14 | 1d247db64a623 |
15 | cab99cb4d9e1 |
hex | 640dfa8288a7 |
110011200211111 has 2 divisors, whose sum is σ = 110011200211112. Its totient is φ = 110011200211110.
The previous prime is 110011200211093. The next prime is 110011200211139. The reversal of 110011200211111 is 111112002110011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110011200211111 - 211 = 110011200209063 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110011200211091 and 110011200211100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110011200211511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55005600105555 + 55005600105556.
It is an arithmetic number, because the mean of its divisors is an integer number (55005600105556).
Almost surely, 2110011200211111 is an apocalyptic number.
110011200211111 is a deficient number, since it is larger than the sum of its proper divisors (1).
110011200211111 is an equidigital number, since it uses as much as digits as its factorization.
110011200211111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 110011200211111 its reverse (111112002110011), we get a palindrome (221123202321122).
The spelling of 110011200211111 in words is "one hundred ten trillion, eleven billion, two hundred million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •