Base | Representation |
---|---|
bin | 11001010000101101111100… |
… | …110000110100111001101011 |
3 | 112120101001112212121101112211 |
4 | 121100231330300310321223 |
5 | 104030230311112020021 |
6 | 1032142350243145551 |
7 | 32254465605231133 |
oct | 3120557460647153 |
9 | 476331485541484 |
10 | 111100012220011 |
11 | 32444283588271 |
12 | 10563b153752b7 |
13 | 49cb8bc7678b9 |
14 | 1d613aaca9ac3 |
15 | cc9e762c93e1 |
hex | 650b7cc34e6b |
111100012220011 has 8 divisors (see below), whose sum is σ = 111286180512000. Its totient is φ = 110913846237480.
The previous prime is 111100012220003. The next prime is 111100012220039. The reversal of 111100012220011 is 110022210001111.
It is a happy number.
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 111100012220011 - 23 = 111100012220003 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111100012219973 and 111100012220000.
It is not an unprimeable number, because it can be changed into a prime (111100012226011) 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, 115109050 + ... + 116070208.
It is an arithmetic number, because the mean of its divisors is an integer number (13910772564000).
Almost surely, 2111100012220011 is an apocalyptic number.
111100012220011 is a deficient number, since it is larger than the sum of its proper divisors (186168291989).
111100012220011 is an equidigital number, since it uses as much as digits as its factorization.
111100012220011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1154729.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 111100012220011 its reverse (110022210001111), we get a palindrome (221122222221122).
The spelling of 111100012220011 in words is "one hundred eleven trillion, one hundred billion, twelve million, two hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •