Base | Representation |
---|---|
bin | 1010000000111111101011… |
… | …1000001001000111101111 |
3 | 1102222202102212022011022201 |
4 | 2200033322320021013233 |
5 | 2420411001302413241 |
6 | 35230534534322331 |
7 | 2214414556162222 |
oct | 240177270110757 |
9 | 42882385264281 |
10 | 11012210201071 |
11 | 3566285630782 |
12 | 129a2a6ab93a7 |
13 | 61b5a6ca50c1 |
14 | 2a0dcb06d5b9 |
15 | 1416bd5eb931 |
hex | a03fae091ef |
11012210201071 has 2 divisors, whose sum is σ = 11012210201072. Its totient is φ = 11012210201070.
The previous prime is 11012210201021. The next prime is 11012210201087. The reversal of 11012210201071 is 17010201221011.
It is a strong prime.
It is an emirp because it is prime and its reverse (17010201221011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11012210201071 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11012210201021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506105100535 + 5506105100536.
It is an arithmetic number, because the mean of its divisors is an integer number (5506105100536).
Almost surely, 211012210201071 is an apocalyptic number.
11012210201071 is a deficient number, since it is larger than the sum of its proper divisors (1).
11012210201071 is an equidigital number, since it uses as much as digits as its factorization.
11012210201071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 19.
Adding to 11012210201071 its reverse (17010201221011), we get a palindrome (28022411422082).
The spelling of 11012210201071 in words is "eleven trillion, twelve billion, two hundred ten million, two hundred one thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •