Base | Representation |
---|---|
bin | 1010000001011101100110… |
… | …1111011010110101101101 |
3 | 1110000112011202200122002201 |
4 | 2200113121233122311231 |
5 | 2421023430003411223 |
6 | 35234344051021501 |
7 | 2215120632100051 |
oct | 240273157326555 |
9 | 43015152618081 |
10 | 11020244200813 |
11 | 3569728610691 |
12 | 129b96959a891 |
13 | 61c2875908c3 |
14 | 2a1550067c61 |
15 | 1419ddab0ead |
hex | a05d9bdad6d |
11020244200813 has 2 divisors, whose sum is σ = 11020244200814. Its totient is φ = 11020244200812.
The previous prime is 11020244200789. The next prime is 11020244200831. The reversal of 11020244200813 is 31800244202011.
Together with next prime (11020244200831) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5525969144644 + 5494275056169 = 2350738^2 + 2343987^2 .
It is a cyclic number.
It is not a de Polignac number, because 11020244200813 - 25 = 11020244200781 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11020244200873) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510122100406 + 5510122100407.
It is an arithmetic number, because the mean of its divisors is an integer number (5510122100407).
Almost surely, 211020244200813 is an apocalyptic number.
It is an amenable number.
11020244200813 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020244200813 is an equidigital number, since it uses as much as digits as its factorization.
11020244200813 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3072, while the sum is 28.
Adding to 11020244200813 its reverse (31800244202011), we get a palindrome (42820488402824).
The spelling of 11020244200813 in words is "eleven trillion, twenty billion, two hundred forty-four million, two hundred thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •