Base | Representation |
---|---|
bin | 1010000000010110010010… |
… | …1101111010000101110001 |
3 | 1102221200202122101022211221 |
4 | 2200011210231322011301 |
5 | 2420220223324013243 |
6 | 35221500325505041 |
7 | 2213542352426101 |
oct | 240054455720561 |
9 | 42850678338757 |
10 | 11001101001073 |
11 | 35615a4798357 |
12 | 1298106572181 |
13 | 61a526565591 |
14 | 2a0655895201 |
15 | 14126d18bbed |
hex | a0164b7a171 |
11001101001073 has 2 divisors, whose sum is σ = 11001101001074. Its totient is φ = 11001101001072.
The previous prime is 11001101001013. The next prime is 11001101001091. The reversal of 11001101001073 is 37010010110011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6777780075889 + 4223320925184 = 2603417^2 + 2055072^2 .
It is an emirp because it is prime and its reverse (37010010110011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11001101001073 - 213 = 11001100992881 is a prime.
It is not a weakly prime, because it can be changed into another prime (11001101001013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500550500536 + 5500550500537.
It is an arithmetic number, because the mean of its divisors is an integer number (5500550500537).
Almost surely, 211001101001073 is an apocalyptic number.
It is an amenable number.
11001101001073 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001101001073 is an equidigital number, since it uses as much as digits as its factorization.
11001101001073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21, while the sum is 16.
Adding to 11001101001073 its reverse (37010010110011), we get a palindrome (48011111111084).
The spelling of 11001101001073 in words is "eleven trillion, one billion, one hundred one million, one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •