Base | Representation |
---|---|
bin | 11001000010011110010010… |
… | …010000001100101100111011 |
3 | 112102220110212012121120022122 |
4 | 121002132102100030230323 |
5 | 103413211023234101021 |
6 | 1030112535542311455 |
7 | 32123663005440413 |
oct | 3102362220145473 |
9 | 472813765546278 |
10 | 110121120222011 |
11 | 320a7117571728 |
12 | 1042626442858b |
13 | 495a4b9599992 |
14 | 1d29c67d6b643 |
15 | cae782be5bab |
hex | 64279240cb3b |
110121120222011 has 4 divisors (see below), whose sum is σ = 110121141502632. Its totient is φ = 110121098941392.
The previous prime is 110121120221977. The next prime is 110121120222023. The reversal of 110121120222011 is 110222021121011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 110121120222011 - 26 = 110121120221947 is a prime.
It is a super-2 number, since 2×1101211202220112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110121120282011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2681231 + ... + 15080823.
It is an arithmetic number, because the mean of its divisors is an integer number (27530285375658).
Almost surely, 2110121120222011 is an apocalyptic number.
110121120222011 is a deficient number, since it is larger than the sum of its proper divisors (21280621).
110121120222011 is an equidigital number, since it uses as much as digits as its factorization.
110121120222011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21280620.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 110121120222011 its reverse (110222021121011), we get a palindrome (220343141343022).
The spelling of 110121120222011 in words is "one hundred ten trillion, one hundred twenty-one billion, one hundred twenty million, two hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •