Base | Representation |
---|---|
bin | 1011111010110101011011… |
… | …0011010100111000010001 |
3 | 1201101212022222001021212012 |
4 | 2332231112303110320101 |
5 | 3204204330241444122 |
6 | 43512312140512305 |
7 | 2521556031610532 |
oct | 276552663247021 |
9 | 51355288037765 |
10 | 13105401515537 |
11 | 41a2a73553421 |
12 | 1577ab854b695 |
13 | 740aac578aa6 |
14 | 33443a5c4689 |
15 | 17ad7cbda7e2 |
hex | beb56cd4e11 |
13105401515537 has 2 divisors, whose sum is σ = 13105401515538. Its totient is φ = 13105401515536.
The previous prime is 13105401515509. The next prime is 13105401515621. The reversal of 13105401515537 is 73551510450131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12797225537041 + 308175978496 = 3577321^2 + 555136^2 .
It is a cyclic number.
It is not a de Polignac number, because 13105401515537 - 26 = 13105401515473 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13105401515494 and 13105401515503.
It is not a weakly prime, because it can be changed into another prime (13105401115537) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6552700757768 + 6552700757769.
It is an arithmetic number, because the mean of its divisors is an integer number (6552700757769).
Almost surely, 213105401515537 is an apocalyptic number.
It is an amenable number.
13105401515537 is a deficient number, since it is larger than the sum of its proper divisors (1).
13105401515537 is an equidigital number, since it uses as much as digits as its factorization.
13105401515537 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 157500, while the sum is 41.
Adding to 13105401515537 its reverse (73551510450131), we get a palindrome (86656911965668).
The spelling of 13105401515537 in words is "thirteen trillion, one hundred five billion, four hundred one million, five hundred fifteen thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •