Base | Representation |
---|---|
bin | 11001000000101101011111… |
… | …100001011010000110000011 |
3 | 112102110220020211101101122021 |
4 | 121000231133201122012003 |
5 | 103404220010030323021 |
6 | 1025541150150222311 |
7 | 32112144535563301 |
oct | 3100553741320603 |
9 | 472426224341567 |
10 | 110000010011011 |
11 | 3205a818a5865a |
12 | 104068a4954997 |
13 | 494bc58398033 |
14 | 1d240593c9271 |
15 | cab54553dc41 |
hex | 640b5f85a183 |
110000010011011 has 8 divisors (see below), whose sum is σ = 111138039869360. Its totient is φ = 108862061971968.
The previous prime is 110000010010967. The next prime is 110000010011069. The reversal of 110000010011011 is 110110010000011.
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 110000010011011 - 211 = 110000010008963 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110000010010985 and 110000010011003.
It is not an unprimeable number, because it can be changed into a prime (110000010071011) 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, 17750226 + ... + 23131591.
It is an arithmetic number, because the mean of its divisors is an integer number (13892254983670).
Almost surely, 2110000010011011 is an apocalyptic number.
110000010011011 is a deficient number, since it is larger than the sum of its proper divisors (1138029858349).
110000010011011 is an equidigital number, since it uses as much as digits as its factorization.
110000010011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40909653.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 110000010011011 its reverse (110110010000011), we get a palindrome (220110020011022).
The spelling of 110000010011011 in words is "one hundred ten trillion, ten million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •