Base | Representation |
---|---|
bin | 1010011110100100100000… |
… | …0100111011100101011111 |
3 | 1111210022221022121112102112 |
4 | 2213221020010323211133 |
5 | 3002222044223240223 |
6 | 40300205201344235 |
7 | 2266213026251654 |
oct | 247511004734537 |
9 | 44708838545375 |
10 | 11520311540063 |
11 | 3741811592057 |
12 | 136086903807b |
13 | 65748c658091 |
14 | 2bb82c1b9c2b |
15 | 14ea0a596778 |
hex | a7a4813b95f |
11520311540063 has 4 divisors (see below), whose sum is σ = 11526997735368. Its totient is φ = 11513625344760.
The previous prime is 11520311540039. The next prime is 11520311540069. The reversal of 11520311540063 is 36004511302511.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11520311540063 - 26 = 11520311539999 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11520311540069) 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 in 3 ways as a sum of consecutive naturals, for example, 3343095068 + ... + 3343098513.
It is an arithmetic number, because the mean of its divisors is an integer number (2881749433842).
Almost surely, 211520311540063 is an apocalyptic number.
11520311540063 is a deficient number, since it is larger than the sum of its proper divisors (6686195305).
11520311540063 is an equidigital number, since it uses as much as digits as its factorization.
11520311540063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6686195304.
The product of its (nonzero) digits is 10800, while the sum is 32.
Adding to 11520311540063 its reverse (36004511302511), we get a palindrome (47524822842574).
The spelling of 11520311540063 in words is "eleven trillion, five hundred twenty billion, three hundred eleven million, five hundred forty thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •