Base | Representation |
---|---|
bin | 1011111011000110101000… |
… | …0101111100010011100111 |
3 | 1201102022020211210012211222 |
4 | 2332301222011330103213 |
5 | 3204243310123130043 |
6 | 43514354325450555 |
7 | 2522111343312065 |
oct | 276615205742347 |
9 | 51368224705758 |
10 | 13110020130023 |
11 | 41a4a23649893 |
12 | 1578987270a5b |
13 | 7413673b297b |
14 | 334757b69035 |
15 | 17b04d408d68 |
hex | bec6a17c4e7 |
13110020130023 has 8 divisors (see below), whose sum is σ = 13500442452288. Its totient is φ = 12721497673824.
The previous prime is 13110020129989. The next prime is 13110020130061. The reversal of 13110020130023 is 32003102001131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13110020130023 - 26 = 13110020129959 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13110020129983 and 13110020130010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13110020130323) 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, 474952511 + ... + 474980112.
It is an arithmetic number, because the mean of its divisors is an integer number (1687555306536).
Almost surely, 213110020130023 is an apocalyptic number.
13110020130023 is a deficient number, since it is larger than the sum of its proper divisors (390422322265).
13110020130023 is an equidigital number, since it uses as much as digits as its factorization.
13110020130023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 949933033.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 13110020130023 its reverse (32003102001131), we get a palindrome (45113122131154).
The spelling of 13110020130023 in words is "thirteen trillion, one hundred ten billion, twenty million, one hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •