Base | Representation |
---|---|
bin | 1011111010101101101011… |
… | …0011010010110001010001 |
3 | 1201101122221222102212022021 |
4 | 2332223122303102301101 |
5 | 3204141100202211423 |
6 | 43511325503011441 |
7 | 2521453340624662 |
oct | 276533263226121 |
9 | 51348858385267 |
10 | 13103321132113 |
11 | 41a20a61a3583 |
12 | 1577617899b81 |
13 | 74083a568994 |
14 | 3342c01a3369 |
15 | 17acaa24a95d |
hex | beadacd2c51 |
13103321132113 has 2 divisors, whose sum is σ = 13103321132114. Its totient is φ = 13103321132112.
The previous prime is 13103321132039. The next prime is 13103321132117. The reversal of 13103321132113 is 31123112330131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12210188398864 + 893132733249 = 3494308^2 + 945057^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13103321132113 is a prime.
It is a super-2 number, since 2×131033211321132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13103321132117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6551660566056 + 6551660566057.
It is an arithmetic number, because the mean of its divisors is an integer number (6551660566057).
Almost surely, 213103321132113 is an apocalyptic number.
It is an amenable number.
13103321132113 is a deficient number, since it is larger than the sum of its proper divisors (1).
13103321132113 is an equidigital number, since it uses as much as digits as its factorization.
13103321132113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 13103321132113 its reverse (31123112330131), we get a palindrome (44226433462244).
The spelling of 13103321132113 in words is "thirteen trillion, one hundred three billion, three hundred twenty-one million, one hundred thirty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •