Base | Representation |
---|---|
bin | 11001000010011111010011… |
… | …010001100111010001001011 |
3 | 112102220120200020022112001222 |
4 | 121002133103101213101023 |
5 | 103413220242021041021 |
6 | 1030113240112032255 |
7 | 32124032023031630 |
oct | 3102372321472113 |
9 | 472816606275058 |
10 | 110122211112011 |
11 | 320a762732450a |
12 | 1042650983268b |
13 | 495a6315aac17 |
14 | 1d29d2cbb8187 |
15 | cae7e887c6ab |
hex | 6427d346744b |
110122211112011 has 8 divisors (see below), whose sum is σ = 126450419802624. Its totient is φ = 93943118482920.
The previous prime is 110122211111999. The next prime is 110122211112061. The reversal of 110122211112011 is 110211112221011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110122211112011 - 226 = 110122144003147 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110122211112061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37279013795 + ... + 37279016748.
It is an arithmetic number, because the mean of its divisors is an integer number (15806302475328).
Almost surely, 2110122211112011 is an apocalyptic number.
110122211112011 is a deficient number, since it is larger than the sum of its proper divisors (16328208690613).
110122211112011 is an equidigital number, since it uses as much as digits as its factorization.
110122211112011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74558030761.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 110122211112011 its reverse (110211112221011), we get a palindrome (220333323333022).
The spelling of 110122211112011 in words is "one hundred ten trillion, one hundred twenty-two billion, two hundred eleven million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •