Base | Representation |
---|---|
bin | 1100010100110011010110… |
… | …0111010011100011000101 |
3 | 1202222111211211011020000100 |
4 | 3011030311213103203011 |
5 | 3234012003424040023 |
6 | 44453252152234313 |
7 | 2566031221415403 |
oct | 305146547234305 |
9 | 52874754136010 |
10 | 13551521315013 |
11 | 4355193549780 |
12 | 162a46109b999 |
13 | 773b97abbcb6 |
14 | 34bc7ba2a473 |
15 | 18778d4b9c43 |
hex | c53359d38c5 |
13551521315013 has 12 divisors (see below), whose sum is σ = 21353912375328. Its totient is φ = 8213043221160.
The previous prime is 13551521314943. The next prime is 13551521315023. The reversal of 13551521315013 is 31051312515531.
13551521315013 is a `hidden beast` number, since 1 + 3 + 5 + 5 + 15 + 2 + 131 + 501 + 3 = 666.
13551521315013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13551521315013 - 28 = 13551521314757 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13551521315023) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 68442026745 + ... + 68442026942.
It is an arithmetic number, because the mean of its divisors is an integer number (1779492697944).
Almost surely, 213551521315013 is an apocalyptic number.
It is an amenable number.
13551521315013 is a deficient number, since it is larger than the sum of its proper divisors (7802391060315).
13551521315013 is a wasteful number, since it uses less digits than its factorization.
13551521315013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 136884053704 (or 136884053701 counting only the distinct ones).
The product of its (nonzero) digits is 33750, while the sum is 36.
The spelling of 13551521315013 in words is "thirteen trillion, five hundred fifty-one billion, five hundred twenty-one million, three hundred fifteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •