Base | Representation |
---|---|
bin | 101111000010101000… |
… | …111010011001111001 |
3 | 11211101010202020012111 |
4 | 233002220322121321 |
5 | 1311421044121040 |
6 | 35112023412321 |
7 | 3435455102245 |
oct | 570250723171 |
9 | 154333666174 |
10 | 50510145145 |
11 | 1a46a729709 |
12 | 99578b40a1 |
13 | 49bc667765 |
14 | 26323a7425 |
15 | 14a9563dea |
hex | bc2a3a679 |
50510145145 has 32 divisors (see below), whose sum is σ = 62604576000. Its totient is φ = 39103061760.
The previous prime is 50510145131. The next prime is 50510145163. The reversal of 50510145145 is 54154101505.
It is a de Polignac number, because none of the positive numbers 2k-50510145145 is a prime.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 17361951 + ... + 17364859.
It is an arithmetic number, because the mean of its divisors is an integer number (1956393000).
Almost surely, 250510145145 is an apocalyptic number.
It is an amenable number.
50510145145 is a deficient number, since it is larger than the sum of its proper divisors (12094430855).
50510145145 is a wasteful number, since it uses less digits than its factorization.
50510145145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3873.
The product of its (nonzero) digits is 10000, while the sum is 31.
The spelling of 50510145145 in words is "fifty billion, five hundred ten million, one hundred forty-five thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •