Base | Representation |
---|---|
bin | 1011111011001000001101… |
… | …1000001000110010011101 |
3 | 1201102100100101222211000110 |
4 | 2332302003120020302131 |
5 | 3204300142222031031 |
6 | 43514504401520233 |
7 | 2522125014045114 |
oct | 276620330106235 |
9 | 51370311884013 |
10 | 13110444330141 |
11 | 41a51210436a4 |
12 | 1578a85343079 |
13 | 741404248362 |
14 | 33479822cc7b |
15 | 17b07579cc46 |
hex | bec83608c9d |
13110444330141 has 16 divisors (see below), whose sum is σ = 17614520782848. Its totient is φ = 8673335751600.
The previous prime is 13110444330083. The next prime is 13110444330157. The reversal of 13110444330141 is 14103344401131.
It is not a de Polignac number, because 13110444330141 - 215 = 13110444297373 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13110444330099 and 13110444330108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13110444330341) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14319826 + ... + 15207836.
It is an arithmetic number, because the mean of its divisors is an integer number (1100907548928).
Almost surely, 213110444330141 is an apocalyptic number.
It is an amenable number.
13110444330141 is a deficient number, since it is larger than the sum of its proper divisors (4504076452707).
13110444330141 is a wasteful number, since it uses less digits than its factorization.
13110444330141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 925712.
The product of its (nonzero) digits is 6912, while the sum is 30.
Adding to 13110444330141 its reverse (14103344401131), we get a palindrome (27213788731272).
The spelling of 13110444330141 in words is "thirteen trillion, one hundred ten billion, four hundred forty-four million, three hundred thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •