Base | Representation |
---|---|
bin | 1011110101010011101101… |
… | …0001001000110001011001 |
3 | 1201001210020122120011000021 |
4 | 2331110323101020301121 |
5 | 3201130400233201310 |
6 | 43400530210310441 |
7 | 2511655041521443 |
oct | 275247321106131 |
9 | 51053218504007 |
10 | 13010450287705 |
11 | 4166779007602 |
12 | 1561619588421 |
13 | 734b59a43500 |
14 | 32d9cdcbd493 |
15 | 178671d3d5da |
hex | bd53b448c59 |
13010450287705 has 24 divisors (see below), whose sum is σ = 17060986883160. Its totient is φ = 9519572874240.
The previous prime is 13010450287687. The next prime is 13010450287729. The reversal of 13010450287705 is 50778205401031.
13010450287705 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 12 ways, for example, as 4084618849936 + 8925831437769 = 2021044^2 + 2987613^2 .
It is not a de Polignac number, because 13010450287705 - 239 = 12460694473817 is a prime.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 70536256 + ... + 70720465.
It is an arithmetic number, because the mean of its divisors is an integer number (710874453465).
Almost surely, 213010450287705 is an apocalyptic number.
It is an amenable number.
13010450287705 is a deficient number, since it is larger than the sum of its proper divisors (4050536595455).
13010450287705 is a wasteful number, since it uses less digits than its factorization.
13010450287705 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 141256861 (or 141256848 counting only the distinct ones).
The product of its (nonzero) digits is 235200, while the sum is 43.
Adding to 13010450287705 its reverse (50778205401031), we get a palindrome (63788655688736).
The spelling of 13010450287705 in words is "thirteen trillion, ten billion, four hundred fifty million, two hundred eighty-seven thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •