Base | Representation |
---|---|
bin | 1001000110001001000000… |
… | …0100101011100001000011 |
3 | 1022102002120220222101222222 |
4 | 2101202100010223201003 |
5 | 2302324223324323021 |
6 | 33134235315321255 |
7 | 2051361414651035 |
oct | 221422004534103 |
9 | 38362526871888 |
10 | 10001101011011 |
11 | 3206496879980 |
12 | 11563445b022b |
13 | 57713b2a1426 |
14 | 2680ad451c55 |
15 | 1252419286ab |
hex | 9189012b843 |
10001101011011 has 8 divisors (see below), whose sum is σ = 11142425885184. Its totient is φ = 8898465115720.
The previous prime is 10001101011001. The next prime is 10001101011061. The reversal of 10001101011011 is 11011010110001.
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 10001101011011 - 26 = 10001101010947 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10001101011011.
It is not an unprimeable number, because it can be changed into a prime (10001101011001) 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, 9672244175 + ... + 9672245208.
It is an arithmetic number, because the mean of its divisors is an integer number (1392803235648).
Almost surely, 210001101011011 is an apocalyptic number.
10001101011011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10001101011011 is a deficient number, since it is larger than the sum of its proper divisors (1141324874173).
10001101011011 is a wasteful number, since it uses less digits than its factorization.
10001101011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19344489441.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 10001101011011 its reverse (11011010110001), we get a palindrome (21012111121012).
The spelling of 10001101011011 in words is "ten trillion, one billion, one hundred one million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •