Base | Representation |
---|---|
bin | 1010000000111111010001… |
… | …0111111100111000110111 |
3 | 1102222202011021000012111121 |
4 | 2200033310113330320313 |
5 | 2420410240340132223 |
6 | 35230520040044411 |
7 | 2214412062630451 |
oct | 240176427747067 |
9 | 42882137005447 |
10 | 11012101099063 |
11 | 3566229a92829 |
12 | 129a276463707 |
13 | 61b58a4c56bc |
14 | 2a0dba78d2d1 |
15 | 1416b3c4a15d |
hex | a03f45fce37 |
11012101099063 has 2 divisors, whose sum is σ = 11012101099064. Its totient is φ = 11012101099062.
The previous prime is 11012101099057. The next prime is 11012101099067. The reversal of 11012101099063 is 36099010121011.
It is a strong prime.
It is an emirp because it is prime and its reverse (36099010121011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11012101099063 - 213 = 11012101090871 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11012101099067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506050549531 + 5506050549532.
It is an arithmetic number, because the mean of its divisors is an integer number (5506050549532).
Almost surely, 211012101099063 is an apocalyptic number.
11012101099063 is a deficient number, since it is larger than the sum of its proper divisors (1).
11012101099063 is an equidigital number, since it uses as much as digits as its factorization.
11012101099063 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 34.
The spelling of 11012101099063 in words is "eleven trillion, twelve billion, one hundred one million, ninety-nine thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •