Base | Representation |
---|---|
bin | 101110100100010010… |
… | …111001000101110011 |
3 | 11210001122210211100020 |
4 | 232210102321011303 |
5 | 1304400232243430 |
6 | 34545320054523 |
7 | 3420033651543 |
oct | 564422710563 |
9 | 153048724306 |
10 | 50001056115 |
11 | 1a22932457a |
12 | 9835304443 |
13 | 493b04c64a |
14 | 25c4927323 |
15 | 1479a02b10 |
hex | ba44b9173 |
50001056115 has 48 divisors (see below), whose sum is σ = 87281652192. Its totient is φ = 24420151296.
The previous prime is 50001056101. The next prime is 50001056153. The reversal of 50001056115 is 51165010005.
50001056115 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 50001056115 - 212 = 50001052019 is a prime.
It is a super-2 number, since 2×500010561152 (a number of 22 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4527 + ... + 316263.
It is an arithmetic number, because the mean of its divisors is an integer number (1818367754).
Almost surely, 250001056115 is an apocalyptic number.
50001056115 is a deficient number, since it is larger than the sum of its proper divisors (37280596077).
50001056115 is a wasteful number, since it uses less digits than its factorization.
50001056115 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 311816 (or 311799 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 24.
The spelling of 50001056115 in words is "fifty billion, one million, fifty-six thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •