Base | Representation |
---|---|
bin | 11001000010010100111110… |
… | …010100000011100000110011 |
3 | 112102212112001102012212212222 |
4 | 121002110332110003200303 |
5 | 103413030034213342321 |
6 | 1030104203502111255 |
7 | 32123160152162615 |
oct | 3102247624034063 |
9 | 472775042185788 |
10 | 110111122012211 |
11 | 320a295686a721 |
12 | 10424333b7b52b |
13 | 49595850882c8 |
14 | 1d2959a152db5 |
15 | cae39a08d3ab |
hex | 64253e503833 |
110111122012211 has 8 divisors (see below), whose sum is σ = 116109432753600. Its totient is φ = 104133110123880.
The previous prime is 110111122012187. The next prime is 110111122012259. The reversal of 110111122012211 is 112210221111011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110111122012211 - 222 = 110111117817907 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 110111122012211.
It is not an unprimeable number, because it can be changed into a prime (110111122012511) 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, 5074702121 + ... + 5074723818.
It is an arithmetic number, because the mean of its divisors is an integer number (14513679094200).
Almost surely, 2110111122012211 is an apocalyptic number.
110111122012211 is a deficient number, since it is larger than the sum of its proper divisors (5998310741389).
110111122012211 is a wasteful number, since it uses less digits than its factorization.
110111122012211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10149426529.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 110111122012211 its reverse (112210221111011), we get a palindrome (222321343123222).
The spelling of 110111122012211 in words is "one hundred ten trillion, one hundred eleven billion, one hundred twenty-two million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •