Base | Representation |
---|---|
bin | 1011111011000110101000… |
… | …0101011101001000000111 |
3 | 1201102022020211112201122220 |
4 | 2332301222011131020013 |
5 | 3204243310110033221 |
6 | 43514354323023423 |
7 | 2522111342240541 |
oct | 276615205351007 |
9 | 51368224481586 |
10 | 13110020002311 |
11 | 41a4a23571941 |
12 | 157898720ab73 |
13 | 7413673697bb |
14 | 334757b34691 |
15 | 17b04d3d10c6 |
hex | bec6a15d207 |
13110020002311 has 8 divisors (see below), whose sum is σ = 17740922590464. Its totient is φ = 8609565374520.
The previous prime is 13110020002309. The next prime is 13110020002367. The reversal of 13110020002311 is 11320002001131.
It is a happy number.
13110020002311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13110020002311 - 21 = 13110020002309 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13110020002711) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 32611989855 + ... + 32611990256.
It is an arithmetic number, because the mean of its divisors is an integer number (2217615323808).
Almost surely, 213110020002311 is an apocalyptic number.
13110020002311 is a deficient number, since it is larger than the sum of its proper divisors (4630902588153).
13110020002311 is an equidigital number, since it uses as much as digits as its factorization.
13110020002311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65223980181.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 13110020002311 its reverse (11320002001131), we get a palindrome (24430022003442).
The spelling of 13110020002311 in words is "thirteen trillion, one hundred ten billion, twenty million, two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •