Base | Representation |
---|---|
bin | 1010000010111111011101… |
… | …0111110110000010100011 |
3 | 1110010000222100120110011021 |
4 | 2200233313113312002203 |
5 | 2421441223323003102 |
6 | 35254410330430311 |
7 | 2220040562310505 |
oct | 240576727660243 |
9 | 43100870513137 |
10 | 11046511141027 |
11 | 357988761463a |
12 | 12a4a7a292397 |
13 | 6218b242848b |
14 | 2a29227a7d75 |
15 | 142529ae3137 |
hex | a0bf75f60a3 |
11046511141027 has 2 divisors, whose sum is σ = 11046511141028. Its totient is φ = 11046511141026.
The previous prime is 11046511141013. The next prime is 11046511141067. The reversal of 11046511141027 is 72014111564011.
It is a weak prime.
It is an emirp because it is prime and its reverse (72014111564011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11046511141027 - 211 = 11046511138979 is a prime.
It is a super-2 number, since 2×110465111410272 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11046511140983 and 11046511141001.
It is not a weakly prime, because it can be changed into another prime (11046511141067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5523255570513 + 5523255570514.
It is an arithmetic number, because the mean of its divisors is an integer number (5523255570514).
Almost surely, 211046511141027 is an apocalyptic number.
11046511141027 is a deficient number, since it is larger than the sum of its proper divisors (1).
11046511141027 is an equidigital number, since it uses as much as digits as its factorization.
11046511141027 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6720, while the sum is 34.
The spelling of 11046511141027 in words is "eleven trillion, forty-six billion, five hundred eleven million, one hundred forty-one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.586 sec. • engine limits •