Base | Representation |
---|---|
bin | 1010000000111110111110… |
… | …1111010000011000011001 |
3 | 1102222201221211122201121201 |
4 | 2200033233233100120121 |
5 | 2420410110432302022 |
6 | 35230504221034201 |
7 | 2214410126553535 |
oct | 240175757203031 |
9 | 42881854581551 |
10 | 11012023322137 |
11 | 356619a09a882 |
12 | 129a2543b5961 |
13 | 61b577363156 |
14 | 2a0db0304bc5 |
15 | 1416abed5127 |
hex | a03efbd0619 |
11012023322137 has 2 divisors, whose sum is σ = 11012023322138. Its totient is φ = 11012023322136.
The previous prime is 11012023322063. The next prime is 11012023322143. The reversal of 11012023322137 is 73122332021011.
11012023322137 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10923626518281 + 88396803856 = 3305091^2 + 297316^2 .
It is a cyclic number.
It is not a de Polignac number, because 11012023322137 - 215 = 11012023289369 is a prime.
It is not a weakly prime, because it can be changed into another prime (11012023322197) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506011661068 + 5506011661069.
It is an arithmetic number, because the mean of its divisors is an integer number (5506011661069).
Almost surely, 211012023322137 is an apocalyptic number.
It is an amenable number.
11012023322137 is a deficient number, since it is larger than the sum of its proper divisors (1).
11012023322137 is an equidigital number, since it uses as much as digits as its factorization.
11012023322137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3024, while the sum is 28.
Adding to 11012023322137 its reverse (73122332021011), we get a palindrome (84134355343148).
The spelling of 11012023322137 in words is "eleven trillion, twelve billion, twenty-three million, three hundred twenty-two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •