Base | Representation |
---|---|
bin | 10000000000011101110… |
… | …000111101010010110011 |
3 | 10220011022122202200021121 |
4 | 100000131300331102303 |
5 | 121010310304013021 |
6 | 2201201005203111 |
7 | 142321204143316 |
oct | 20003560752263 |
9 | 3804278680247 |
10 | 1100011001011 |
11 | 39456a59523a |
12 | 159233560497 |
13 | 7c96615a650 |
14 | 3b352b2c97d |
15 | 1d931925741 |
hex | 1001dc3d4b3 |
1100011001011 has 8 divisors (see below), whose sum is σ = 1184783683104. Its totient is φ = 1015260669120.
The previous prime is 1100011000999. The next prime is 1100011001021. The reversal of 1100011001011 is 1101001100011.
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 1100011001011 - 213 = 1100010992819 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1100011000985 and 1100011001003.
It is not an unprimeable number, because it can be changed into a prime (1100011001021) 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, 5485255 + ... + 5682256.
It is an arithmetic number, because the mean of its divisors is an integer number (148097960388).
Almost surely, 21100011001011 is an apocalyptic number.
1100011001011 is a deficient number, since it is larger than the sum of its proper divisors (84772682093).
1100011001011 is a wasteful number, since it uses less digits than its factorization.
1100011001011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11175101.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 1100011001011 its reverse (1101001100011), we get a palindrome (2201012101022).
It can be divided in two parts, 110001 and 1001011, that multiplied together give a palindrome (110112211011).
The spelling of 1100011001011 in words is "one trillion, one hundred billion, eleven million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •