Base | Representation |
---|---|
bin | 101110100100001111… |
… | …010010001110101011 |
3 | 11210001121000210012201 |
4 | 232210033102032223 |
5 | 1304400012014012 |
6 | 34545243521031 |
7 | 3420022632634 |
oct | 564417221653 |
9 | 153047023181 |
10 | 50000110507 |
11 | 1a228839086 |
12 | 9834b29177 |
13 | 493aaab109 |
14 | 25c475c88b |
15 | 14798b7857 |
hex | ba43d23ab |
50000110507 has 6 divisors (see below), whose sum is σ = 53114304548. Its totient is φ = 47058927264.
The previous prime is 50000110493. The next prime is 50000110553. The reversal of 50000110507 is 70501100005.
It is not a de Polignac number, because 50000110507 - 27 = 50000110379 is a prime.
It is a super-2 number, since 2×500001105072 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50000110597) 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 5 ways as a sum of consecutive naturals, for example, 86505093 + ... + 86505670.
Almost surely, 250000110507 is an apocalyptic number.
50000110507 is a deficient number, since it is larger than the sum of its proper divisors (3114194041).
50000110507 is a wasteful number, since it uses less digits than its factorization.
50000110507 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173010797 (or 173010780 counting only the distinct ones).
The product of its (nonzero) digits is 175, while the sum is 19.
The spelling of 50000110507 in words is "fifty billion, one hundred ten thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •