Base | Representation |
---|---|
bin | 11001000010011110010010… |
… | …001111101111011001111011 |
3 | 112102220110212012101110201012 |
4 | 121002132102033233121323 |
5 | 103413211023221231021 |
6 | 1030112535535544135 |
7 | 32123663004430514 |
oct | 3102362217573173 |
9 | 472813765343635 |
10 | 110121120102011 |
11 | 320a711749a557 |
12 | 1042626438b04b |
13 | 495a4b9557185 |
14 | 1d29c67d39a0b |
15 | cae782bc035b |
hex | 6427923ef67b |
110121120102011 has 2 divisors, whose sum is σ = 110121120102012. Its totient is φ = 110121120102010.
The previous prime is 110121120101953. The next prime is 110121120102041. The reversal of 110121120102011 is 110201021121011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110121120102011 - 210 = 110121120100987 is a prime.
It is a super-2 number, since 2×1101211201020112 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (110121120102041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55060560051005 + 55060560051006.
It is an arithmetic number, because the mean of its divisors is an integer number (55060560051006).
Almost surely, 2110121120102011 is an apocalyptic number.
110121120102011 is a deficient number, since it is larger than the sum of its proper divisors (1).
110121120102011 is an equidigital number, since it uses as much as digits as its factorization.
110121120102011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 110121120102011 its reverse (110201021121011), we get a palindrome (220322141223022).
The spelling of 110121120102011 in words is "one hundred ten trillion, one hundred twenty-one billion, one hundred twenty million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •