Base | Representation |
---|---|
bin | 110011001110010000… |
… | …1000111110110100011 |
3 | 101111221002121121122121 |
4 | 1212130201013312203 |
5 | 3300240012023021 |
6 | 122311112045111 |
7 | 10642622342050 |
oct | 1463441076643 |
9 | 344832547577 |
10 | 110000111011 |
11 | 4271821655a |
12 | 1939a993797 |
13 | a4b05385ab |
14 | 5477212027 |
15 | 2cdc11a741 |
hex | 199c847da3 |
110000111011 has 8 divisors (see below), whose sum is σ = 127010438240. Its totient is φ = 93313790208.
The previous prime is 110000111009. The next prime is 110000111021. The reversal of 110000111011 is 110111000011.
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 110000111011 - 21 = 110000111009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a junction number, because it is equal to n+sod(n) for n = 110000110985 and 110000111003.
It is not an unprimeable number, because it can be changed into a prime (110000111021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 81000876 + ... + 81002233.
It is an arithmetic number, because the mean of its divisors is an integer number (15876304780).
Almost surely, 2110000111011 is an apocalyptic number.
110000111011 is a deficient number, since it is larger than the sum of its proper divisors (17010327229).
110000111011 is an equidigital number, since it uses as much as digits as its factorization.
110000111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162003213.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 110000111011 its reverse (110111000011), we get a palindrome (220111111022).
The spelling of 110000111011 in words is "one hundred ten billion, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •