Base | Representation |
---|---|
bin | 11001000001000000001101… |
… | …100101001111100010010111 |
3 | 112102112211010122021210010111 |
4 | 121001000031211033202113 |
5 | 103410032141142333421 |
6 | 1025554312453303451 |
7 | 32113455614651341 |
oct | 3101001545174227 |
9 | 472484118253114 |
10 | 110020110121111 |
11 | 320682a2a438a3 |
12 | 1040a774334b87 |
13 | 4950b0c7245c8 |
14 | 1d25004ad0291 |
15 | cabd1ee81ee1 |
hex | 64100d94f897 |
110020110121111 has 2 divisors, whose sum is σ = 110020110121112. Its totient is φ = 110020110121110.
The previous prime is 110020110121093. The next prime is 110020110121177. The reversal of 110020110121111 is 111121011020011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110020110121111 - 211 = 110020110119063 is a prime.
It is a super-2 number, since 2×1100201101211112 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110020110121091 and 110020110121100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110020110121511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55010055060555 + 55010055060556.
It is an arithmetic number, because the mean of its divisors is an integer number (55010055060556).
Almost surely, 2110020110121111 is an apocalyptic number.
110020110121111 is a deficient number, since it is larger than the sum of its proper divisors (1).
110020110121111 is an equidigital number, since it uses as much as digits as its factorization.
110020110121111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 110020110121111 its reverse (111121011020011), we get a palindrome (221141121141122).
The spelling of 110020110121111 in words is "one hundred ten trillion, twenty billion, one hundred ten million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •