Base | Representation |
---|---|
bin | 1010000000111111010100… |
… | …0100010100110101111001 |
3 | 1102222202012001220012020002 |
4 | 2200033311010110311321 |
5 | 2420410301324402023 |
6 | 35230521133242345 |
7 | 2214412263536345 |
oct | 240176504246571 |
9 | 42882161805202 |
10 | 11012112731513 |
11 | 3566235608423 |
12 | 129a27a3333b5 |
13 | 61b58ca392ca |
14 | 2a0dbc13a625 |
15 | 1416b4c96b28 |
hex | a03f5114d79 |
11012112731513 has 2 divisors, whose sum is σ = 11012112731514. Its totient is φ = 11012112731512.
The previous prime is 11012112731413. The next prime is 11012112731551. The reversal of 11012112731513 is 31513721121011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10650060214249 + 362052517264 = 3263443^2 + 601708^2 .
It is a cyclic number.
It is not a de Polignac number, because 11012112731513 - 214 = 11012112715129 is a prime.
It is not a weakly prime, because it can be changed into another prime (11012112731573) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506056365756 + 5506056365757.
It is an arithmetic number, because the mean of its divisors is an integer number (5506056365757).
Almost surely, 211012112731513 is an apocalyptic number.
It is an amenable number.
11012112731513 is a deficient number, since it is larger than the sum of its proper divisors (1).
11012112731513 is an equidigital number, since it uses as much as digits as its factorization.
11012112731513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1260, while the sum is 29.
Adding to 11012112731513 its reverse (31513721121011), we get a palindrome (42525833852524).
The spelling of 11012112731513 in words is "eleven trillion, twelve billion, one hundred twelve million, seven hundred thirty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •