Base | Representation |
---|---|
bin | 11001000000101110100000… |
… | …100011100111111011011010 |
3 | 112102111000001212111000110001 |
4 | 121000232200203213323122 |
5 | 103404224223341023002 |
6 | 1025541450324243214 |
7 | 32112213555020653 |
oct | 3100564043477332 |
9 | 472430055430401 |
10 | 110001101111002 |
11 | 32060228944192 |
12 | 10406b4a24050a |
13 | 494c0a0450a2a |
14 | 1d2412028c52a |
15 | cab5ab217a87 |
hex | 640ba08e7eda |
110001101111002 has 32 divisors (see below), whose sum is σ = 165580365758400. Its totient is φ = 54808090598400.
The previous prime is 110001101110949. The next prime is 110001101111021. The reversal of 110001101111002 is 200111101100011.
It is a self number, because there is not a number n which added to its sum of digits gives 110001101111002.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1325129274 + ... + 1325212282.
It is an arithmetic number, because the mean of its divisors is an integer number (5174386429950).
Almost surely, 2110001101111002 is an apocalyptic number.
110001101111002 is a deficient number, since it is larger than the sum of its proper divisors (55579264647398).
110001101111002 is a wasteful number, since it uses less digits than its factorization.
110001101111002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85662.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 110001101111002 its reverse (200111101100011), we get a palindrome (310112202211013).
The spelling of 110001101111002 in words is "one hundred ten trillion, one billion, one hundred one million, one hundred eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.040 sec. • engine limits •