Base | Representation |
---|---|
bin | 10000001110011101110… |
… | …001011100101010000101 |
3 | 10221121010022002111210110 |
4 | 100032131301130222011 |
5 | 121232102114440023 |
6 | 2212124404143233 |
7 | 143362550331621 |
oct | 20163561345205 |
9 | 3847108074713 |
10 | 1115043515013 |
11 | 39a983aa452a |
12 | 160129997b19 |
13 | 811c064ba4c |
14 | 3bd7b3b8181 |
15 | 1e01150da93 |
hex | 1039dc5ca85 |
1115043515013 has 16 divisors (see below), whose sum is σ = 1523036704896. Its totient is φ = 725207535360.
The previous prime is 1115043515009. The next prime is 1115043515077. The reversal of 1115043515013 is 3105153405111.
It is not a de Polignac number, because 1115043515013 - 22 = 1115043515009 is a prime.
It is a super-5 number, since 5×11150435150135 (a number of 61 digits) contains 55555 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1115043515083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4055920 + ... + 4322102.
It is an arithmetic number, because the mean of its divisors is an integer number (95189794056).
Almost surely, 21115043515013 is an apocalyptic number.
It is an amenable number.
1115043515013 is a deficient number, since it is larger than the sum of its proper divisors (407993189883).
1115043515013 is a wasteful number, since it uses less digits than its factorization.
1115043515013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 300284.
The product of its (nonzero) digits is 4500, while the sum is 30.
The spelling of 1115043515013 in words is "one trillion, one hundred fifteen billion, forty-three million, five hundred fifteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •