Base | Representation |
---|---|
bin | 11101001000101100100… |
… | …01101010111011100011 |
3 | 10112201000110100122211100 |
4 | 32210112101222323203 |
5 | 112400223341023021 |
6 | 2043522143045443 |
7 | 132220135020141 |
oct | 16442621527343 |
9 | 3481013318740 |
10 | 1001101111011 |
11 | 3566235299a1 |
12 | 14202a8a0883 |
13 | 73532448111 |
14 | 3664c794591 |
15 | 1b09326b626 |
hex | e91646aee3 |
1001101111011 has 12 divisors (see below), whose sum is σ = 1446790862088. Its totient is φ = 667051852704.
The previous prime is 1001101110967. The next prime is 1001101111039. The reversal of 1001101111011 is 1101111011001.
It is not a de Polignac number, because 1001101111011 - 213 = 1001101102819 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 = 1001101110984 and 1001101111002.
It is not an unprimeable number, because it can be changed into a prime (1001101116011) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 29055825 + ... + 29090258.
It is an arithmetic number, because the mean of its divisors is an integer number (120565905174).
Almost surely, 21001101111011 is an apocalyptic number.
1001101111011 is a deficient number, since it is larger than the sum of its proper divisors (445689751077).
1001101111011 is a wasteful number, since it uses less digits than its factorization.
1001101111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58148002 (or 58147999 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 1001101111011 its reverse (1101111011001), we get a palindrome (2102212122012).
It can be divided in two parts, 100110 and 1111011, that added together give a palindrome (1211121).
The spelling of 1001101111011 in words is "one trillion, one billion, one hundred one million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •