Base | Representation |
---|---|
bin | 11001000010011110011000… |
… | …001101010010000110110011 |
3 | 112102220111010011120221222121 |
4 | 121002132120031102012303 |
5 | 103413211224322333021 |
6 | 1030112553511415111 |
7 | 32123665330532221 |
oct | 3102363015220663 |
9 | 472814104527877 |
10 | 110121220121011 |
11 | 320a71689a4290 |
12 | 10426291984497 |
13 | 495a5041a6508 |
14 | 1d29c77333b11 |
15 | cae78b87a741 |
hex | 6427983521b3 |
110121220121011 has 16 divisors (see below), whose sum is σ = 120412479765600. Its totient is φ = 99876846009600.
The previous prime is 110121220120949. The next prime is 110121220121051. The reversal of 110121220121011 is 110121022121011.
It is not a de Polignac number, because 110121220121011 - 211 = 110121220118963 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110121220121051) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7840735 + ... + 16784503.
It is an arithmetic number, because the mean of its divisors is an integer number (7525779985350).
Almost surely, 2110121220121011 is an apocalyptic number.
110121220121011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
110121220121011 is a deficient number, since it is larger than the sum of its proper divisors (10291259644589).
110121220121011 is a wasteful number, since it uses less digits than its factorization.
110121220121011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8946390.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 110121220121011 its reverse (110121022121011), we get a palindrome (220242242242022).
The spelling of 110121220121011 in words is "one hundred ten trillion, one hundred twenty-one billion, two hundred twenty million, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.385 sec. • engine limits •