Base | Representation |
---|---|
bin | 1100010001111000010101… |
… | …1001010101110101110001 |
3 | 1202210201021012221120112101 |
4 | 3010132011121111311301 |
5 | 3232201200434132423 |
6 | 44414230524500401 |
7 | 2562303205242661 |
oct | 304360531256561 |
9 | 52721235846471 |
10 | 13501320224113 |
11 | 43359723190a7 |
12 | 16207909aa701 |
13 | 76c2274a2597 |
14 | 3496787121a1 |
15 | 1863011527ad |
hex | c4785655d71 |
13501320224113 has 32 divisors (see below), whose sum is σ = 14118435302400. Its totient is φ = 12903190949376.
The previous prime is 13501320224107. The next prime is 13501320224131. The reversal of 13501320224113 is 31142202310531.
13501320224113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13501320224113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13501320224143) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 106273756 + ... + 106400722.
It is an arithmetic number, because the mean of its divisors is an integer number (441201103200).
Almost surely, 213501320224113 is an apocalyptic number.
It is an amenable number.
13501320224113 is a deficient number, since it is larger than the sum of its proper divisors (617115078287).
13501320224113 is a wasteful number, since it uses less digits than its factorization.
13501320224113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 127441.
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 13501320224113 its reverse (31142202310531), we get a palindrome (44643522534644).
The spelling of 13501320224113 in words is "thirteen trillion, five hundred one billion, three hundred twenty million, two hundred twenty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •