Base | Representation |
---|---|
bin | 100101001101111110011… |
… | …0011010110010101111111 |
3 | 200010000100201211202011110 |
4 | 1022123330303112111333 |
5 | 1132302014103322120 |
6 | 14513525311253103 |
7 | 1035364503003453 |
oct | 112337463262577 |
9 | 20100321752143 |
10 | 5115252401535 |
11 | 16a2403698691 |
12 | 6a745381a193 |
13 | 2b149b7c3573 |
14 | 139818370663 |
15 | 8d0d59cb2e0 |
hex | 4a6fccd657f |
5115252401535 has 64 divisors (see below), whose sum is σ = 8527623413760. Its totient is φ = 2615387927040.
The previous prime is 5115252401527. The next prime is 5115252401549. The reversal of 5115252401535 is 5351042525115.
It is not a de Polignac number, because 5115252401535 - 23 = 5115252401527 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5115252401493 and 5115252401502.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 495035229 + ... + 495045561.
It is an arithmetic number, because the mean of its divisors is an integer number (133244115840).
Almost surely, 25115252401535 is an apocalyptic number.
5115252401535 is a deficient number, since it is larger than the sum of its proper divisors (3412371012225).
5115252401535 is a wasteful number, since it uses less digits than its factorization.
5115252401535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20248.
The product of its (nonzero) digits is 150000, while the sum is 39.
The spelling of 5115252401535 in words is "five trillion, one hundred fifteen billion, two hundred fifty-two million, four hundred one thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •