Base | Representation |
---|---|
bin | 1001010101011000… |
… | …00001100010110001 |
3 | 110221020100211220010 |
4 | 10222230001202301 |
5 | 40230323313100 |
6 | 2145130205133 |
7 | 235116036516 |
oct | 45254014261 |
9 | 13836324803 |
10 | 5011151025 |
11 | 2141733a31 |
12 | b7a2837a9 |
13 | 61b26432a |
14 | 35776530d |
15 | 1e4e0a750 |
hex | 12ab018b1 |
5011151025 has 12 divisors (see below), whose sum is σ = 8285103152. Its totient is φ = 2672613840.
The previous prime is 5011151011. The next prime is 5011151069. The reversal of 5011151025 is 5201511105.
It is not a de Polignac number, because 5011151025 - 25 = 5011150993 is a prime.
It is a super-2 number, since 2×50111510252 = 50223269190717101250, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5011150992 and 5011151010.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 33407599 + ... + 33407748.
Almost surely, 25011151025 is an apocalyptic number.
It is an amenable number.
5011151025 is a deficient number, since it is larger than the sum of its proper divisors (3273952127).
5011151025 is a wasteful number, since it uses less digits than its factorization.
5011151025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66815360 (or 66815355 counting only the distinct ones).
The product of its (nonzero) digits is 250, while the sum is 21.
The square root of 5011151025 is about 70789.4838588332. The cubic root of 5011151025 is about 1711.2462018031.
The spelling of 5011151025 in words is "five billion, eleven million, one hundred fifty-one thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •