Base | Representation |
---|---|
bin | 1010100010001100010011… |
… | …1001000111101011101011 |
3 | 1112000021112210021211010220 |
4 | 2220203010321013223223 |
5 | 3004232012443404102 |
6 | 40344535421141123 |
7 | 2303545006151400 |
oct | 250430471075353 |
9 | 45007483254126 |
10 | 11582535138027 |
11 | 3766142147187 |
12 | 13709336ba7a3 |
13 | 6602c79898b9 |
14 | 2c08520d02a7 |
15 | 15144d1281bc |
hex | a88c4e47aeb |
11582535138027 has 12 divisors (see below), whose sum is σ = 17964748377576. Its totient is φ = 6618591507360.
The previous prime is 11582535137981. The next prime is 11582535138073. The reversal of 11582535138027 is 72083153528511.
11582535138027 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (11582535137981) and next prime (11582535138073).
It is not a de Polignac number, because 11582535138027 - 216 = 11582535072491 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11582535138077) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 39396377874 + ... + 39396378167.
It is an arithmetic number, because the mean of its divisors is an integer number (1497062364798).
Almost surely, 211582535138027 is an apocalyptic number.
11582535138027 is a deficient number, since it is larger than the sum of its proper divisors (6382213239549).
11582535138027 is an equidigital number, since it uses as much as digits as its factorization.
11582535138027 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78792756058 (or 78792756051 counting only the distinct ones).
The product of its (nonzero) digits is 2016000, while the sum is 51.
The spelling of 11582535138027 in words is "eleven trillion, five hundred eighty-two billion, five hundred thirty-five million, one hundred thirty-eight thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •