Base | Representation |
---|---|
bin | 1011111010110101110110… |
… | …0100010110011100111001 |
3 | 1201101212121212122102212202 |
4 | 2332231131210112130321 |
5 | 3204210043321432304 |
6 | 43512331313515545 |
7 | 2521561610511461 |
oct | 276553544263471 |
9 | 51355555572782 |
10 | 13105515030329 |
11 | 41a30216357a7 |
12 | 1577b2a572bb5 |
13 | 740ac9c41bc7 |
14 | 33444b6d2ba1 |
15 | 17ad87b5e81e |
hex | beb5d916739 |
13105515030329 has 2 divisors, whose sum is σ = 13105515030330. Its totient is φ = 13105515030328.
The previous prime is 13105515030301. The next prime is 13105515030343. The reversal of 13105515030329 is 92303051550131.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7183884796729 + 5921630233600 = 2680277^2 + 2433440^2 .
It is an emirp because it is prime and its reverse (92303051550131) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13105515030329 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13105515030292 and 13105515030301.
It is not a weakly prime, because it can be changed into another prime (13105517030329) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6552757515164 + 6552757515165.
It is an arithmetic number, because the mean of its divisors is an integer number (6552757515165).
Almost surely, 213105515030329 is an apocalyptic number.
It is an amenable number.
13105515030329 is a deficient number, since it is larger than the sum of its proper divisors (1).
13105515030329 is an equidigital number, since it uses as much as digits as its factorization.
13105515030329 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 60750, while the sum is 38.
The spelling of 13105515030329 in words is "thirteen trillion, one hundred five billion, five hundred fifteen million, thirty thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •