Base | Representation |
---|---|
bin | 100100011000010011101… |
… | …0000010000010010110111 |
3 | 122200222212122001210011110 |
4 | 1020300213100100102313 |
5 | 1123410000112130030 |
6 | 14344545111210103 |
7 | 1024144450024365 |
oct | 110604720202267 |
9 | 18628778053143 |
10 | 5000000505015 |
11 | 1658540a31a2a |
12 | 68904a076933 |
13 | 2a36622100a9 |
14 | 134003878635 |
15 | 8a0dc7c11b0 |
hex | 48c274104b7 |
5000000505015 has 64 divisors (see below), whose sum is σ = 8359815859200. Its totient is φ = 2547064633344.
The previous prime is 5000000504977. The next prime is 5000000505037. The reversal of 5000000505015 is 5105050000005.
It is not a de Polignac number, because 5000000505015 - 26 = 5000000504951 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5000000504982 and 5000000505000.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 998200831 + ... + 998205839.
It is an arithmetic number, because the mean of its divisors is an integer number (130622122800).
Almost surely, 25000000505015 is an apocalyptic number.
5000000505015 is a deficient number, since it is larger than the sum of its proper divisors (3359815354185).
5000000505015 is a wasteful number, since it uses less digits than its factorization.
5000000505015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8616.
The product of its (nonzero) digits is 625, while the sum is 21.
The spelling of 5000000505015 in words is "five trillion, five hundred five thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •