Base | Representation |
---|---|
bin | 11001000000101110011011… |
… | …001100010000110101010011 |
3 | 112102110222211121010000221200 |
4 | 121000232123030100311103 |
5 | 103404224032320213021 |
6 | 1025541433351122243 |
7 | 32112211412654112 |
oct | 3100563314206523 |
9 | 472428747100850 |
10 | 110001011101011 |
11 | 32060192056368 |
12 | 10406b24073383 |
13 | 494c0878c7394 |
14 | 1d2411233bc79 |
15 | cab5a3388126 |
hex | 640b9b310d53 |
110001011101011 has 48 divisors (see below), whose sum is σ = 161968231613760. Its totient is φ = 71920530063360.
The previous prime is 110001011100941. The next prime is 110001011101021. The reversal of 110001011101011 is 110101110100011.
It is not a de Polignac number, because 110001011101011 - 211 = 110001011098963 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 110001011100984 and 110001011101002.
It is not an unprimeable number, because it can be changed into a prime (110001011101021) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2689688115 + ... + 2689729011.
It is an arithmetic number, because the mean of its divisors is an integer number (3374338158620).
Almost surely, 2110001011101011 is an apocalyptic number.
110001011101011 is a deficient number, since it is larger than the sum of its proper divisors (51967220512749).
110001011101011 is a wasteful number, since it uses less digits than its factorization.
110001011101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55196 (or 55193 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 110001011101011 its reverse (110101110100011), we get a palindrome (220102121201022).
The spelling of 110001011101011 in words is "one hundred ten trillion, one billion, eleven million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •