Base | Representation |
---|---|
bin | 1011110101010010011010… |
… | …1010000111000011100001 |
3 | 1201001202100112220221220222 |
4 | 2331110212222013003201 |
5 | 3201124143223401422 |
6 | 43400432015212425 |
7 | 2511643342502243 |
oct | 275244652070341 |
9 | 51052315827828 |
10 | 13010104512737 |
11 | 4166610908772 |
12 | 1561541817115 |
13 | 734b03209437 |
14 | 32d999dd2093 |
15 | 1786517db842 |
hex | bd526a870e1 |
13010104512737 has 2 divisors, whose sum is σ = 13010104512738. Its totient is φ = 13010104512736.
The previous prime is 13010104512641. The next prime is 13010104512787. The reversal of 13010104512737 is 73721540101031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8658871219216 + 4351233293521 = 2942596^2 + 2085961^2 .
It is a cyclic number.
It is not a de Polignac number, because 13010104512737 - 28 = 13010104512481 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13010104512697 and 13010104512706.
It is not a weakly prime, because it can be changed into another prime (13010104512787) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6505052256368 + 6505052256369.
It is an arithmetic number, because the mean of its divisors is an integer number (6505052256369).
Almost surely, 213010104512737 is an apocalyptic number.
It is an amenable number.
13010104512737 is a deficient number, since it is larger than the sum of its proper divisors (1).
13010104512737 is an equidigital number, since it uses as much as digits as its factorization.
13010104512737 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17640, while the sum is 35.
Adding to 13010104512737 its reverse (73721540101031), we get a palindrome (86731644613768).
The spelling of 13010104512737 in words is "thirteen trillion, ten billion, one hundred four million, five hundred twelve thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •