Base | Representation |
---|---|
bin | 1011111010111001111001… |
… | …0011001100100011101001 |
3 | 1201101222102120012002002011 |
4 | 2332232132103030203221 |
5 | 3204214304332134033 |
6 | 43513031151035521 |
7 | 2521630535526532 |
oct | 276563623144351 |
9 | 51358376162064 |
10 | 13106601052393 |
11 | 41a35296731a2 |
12 | 157819220bba1 |
13 | 740c40c3a504 |
14 | 334511a33689 |
15 | 17aded183ccd |
hex | beb9e4cc8e9 |
13106601052393 has 2 divisors, whose sum is σ = 13106601052394. Its totient is φ = 13106601052392.
The previous prime is 13106601052339. The next prime is 13106601052427. The reversal of 13106601052393 is 39325010660131.
Together with previous prime (13106601052339) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8350551031824 + 4756050020569 = 2889732^2 + 2180837^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13106601052393 is a prime.
It is a super-2 number, since 2×131066010523932 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13106601058393) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6553300526196 + 6553300526197.
It is an arithmetic number, because the mean of its divisors is an integer number (6553300526197).
Almost surely, 213106601052393 is an apocalyptic number.
It is an amenable number.
13106601052393 is a deficient number, since it is larger than the sum of its proper divisors (1).
13106601052393 is an equidigital number, since it uses as much as digits as its factorization.
13106601052393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 87480, while the sum is 40.
The spelling of 13106601052393 in words is "thirteen trillion, one hundred six billion, six hundred one million, fifty-two thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •