Base | Representation |
---|---|
bin | 1001000110001001000000… |
… | …0101000001011111010011 |
3 | 1022102002120221010222110022 |
4 | 2101202100011001133103 |
5 | 2302324223340213021 |
6 | 33134235321254055 |
7 | 2051361415504316 |
oct | 221422005013723 |
9 | 38362527128408 |
10 | 10001101101011 |
11 | 3206496930559 |
12 | 115634463432b |
13 | 57713b303397 |
14 | 2680ad47697d |
15 | 1252419451ab |
hex | 918901417d3 |
10001101101011 has 2 divisors, whose sum is σ = 10001101101012. Its totient is φ = 10001101101010.
The previous prime is 10001101101007. The next prime is 10001101101067. The reversal of 10001101101011 is 11010110110001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10001101101011 - 22 = 10001101101007 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10001101101011.
It is not a weakly prime, because it can be changed into another prime (10001101101071) 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 as a sum of consecutive naturals, namely, 5000550550505 + 5000550550506.
It is an arithmetic number, because the mean of its divisors is an integer number (5000550550506).
Almost surely, 210001101101011 is an apocalyptic number.
10001101101011 is a deficient number, since it is larger than the sum of its proper divisors (1).
10001101101011 is an equidigital number, since it uses as much as digits as its factorization.
10001101101011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 10001101101011 its reverse (11010110110001), we get a palindrome (21011211211012).
The spelling of 10001101101011 in words is "ten trillion, one billion, one hundred one million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •