Base | Representation |
---|---|
bin | 11001000010011110001100… |
… | …011001111011100100111011 |
3 | 112102220110121100222221221212 |
4 | 121002132030121323210323 |
5 | 103413210323130010021 |
6 | 1030112522115353335 |
7 | 32123660404500533 |
oct | 3102361431734473 |
9 | 472813540887855 |
10 | 110121022110011 |
11 | 320a707714a730 |
12 | 104262375b284b |
13 | 495a4a2167643 |
14 | 1d29c58d0c4c3 |
15 | cae7792b585b |
hex | 64278c67b93b |
110121022110011 has 8 divisors (see below), whose sum is σ = 120132938951424. Its totient is φ = 100109257740520.
The previous prime is 110121022109911. The next prime is 110121022110049. The reversal of 110121022110011 is 110011220121011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110121022110011 - 210 = 110121022108987 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110121022110061) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36605231 + ... + 39499176.
It is an arithmetic number, because the mean of its divisors is an integer number (15016617368928).
Almost surely, 2110121022110011 is an apocalyptic number.
110121022110011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
110121022110011 is a deficient number, since it is larger than the sum of its proper divisors (10011916841413).
110121022110011 is a wasteful number, since it uses less digits than its factorization.
110121022110011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76235961.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 110121022110011 its reverse (110011220121011), we get a palindrome (220132242231022).
The spelling of 110121022110011 in words is "one hundred ten trillion, one hundred twenty-one billion, twenty-two million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •