Base | Representation |
---|---|
bin | 11101001000100000101… |
… | …00001010011011010011 |
3 | 10112200202111011121220021 |
4 | 32210100110022123103 |
5 | 112400022240213021 |
6 | 2043504211324311 |
7 | 132214511653612 |
oct | 16442024123323 |
9 | 3480674147807 |
10 | 1001001101011 |
11 | 3565820309aa |
12 | 1420012b0697 |
13 | 735177ccbc2 |
14 | 3663d39d879 |
15 | 1b0895b3c41 |
hex | e91050a6d3 |
1001001101011 has 8 divisors (see below), whose sum is σ = 1006278587424. Its totient is φ = 995725597440.
The previous prime is 1001001101003. The next prime is 1001001101071. The reversal of 1001001101011 is 1101011001001.
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 1001001101011 - 23 = 1001001101003 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1001001100985 and 1001001101003.
It is not an unprimeable number, because it can be changed into a prime (1001001101071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 522106 + ... + 1508176.
It is an arithmetic number, because the mean of its divisors is an integer number (125784823428).
Almost surely, 21001001101011 is an apocalyptic number.
1001001101011 is a deficient number, since it is larger than the sum of its proper divisors (5277486413).
1001001101011 is an equidigital number, since it uses as much as digits as its factorization.
1001001101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 991421.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 1001001101011 its reverse (1101011001001), we get a palindrome (2102012102012).
The spelling of 1001001101011 in words is "one trillion, one billion, one million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •