Base | Representation |
---|---|
bin | 10110101111001110001000… |
… | …01101000011101101100111 |
3 | 20120001001100002012220111120 |
4 | 23113213010031003231213 |
5 | 23023204030022101101 |
6 | 254202051200305023 |
7 | 13350311353621002 |
oct | 1327470415035547 |
9 | 216031302186446 |
10 | 50001006050151 |
11 | 14a283424344a2 |
12 | 5736643912173 |
13 | 21b90c7c9ac20 |
14 | c4c0c108c539 |
15 | 5ba993138b36 |
hex | 2d79c4343b67 |
50001006050151 has 16 divisors (see below), whose sum is σ = 74272051428960. Its totient is φ = 29708820570240.
The previous prime is 50001006050141. The next prime is 50001006050161. The reversal of 50001006050151 is 15105060010005.
It is an interprime number because it is at equal distance from previous prime (50001006050141) and next prime (50001006050161).
It is not a de Polignac number, because 50001006050151 - 226 = 50000938941287 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50001006050141) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22104776080 + ... + 22104778341.
It is an arithmetic number, because the mean of its divisors is an integer number (4642003214310).
Almost surely, 250001006050151 is an apocalyptic number.
50001006050151 is a deficient number, since it is larger than the sum of its proper divisors (24271045378809).
50001006050151 is a wasteful number, since it uses less digits than its factorization.
50001006050151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44209554466.
The product of its (nonzero) digits is 750, while the sum is 24.
Adding to 50001006050151 its reverse (15105060010005), we get a palindrome (65106066060156).
The spelling of 50001006050151 in words is "fifty trillion, one billion, six million, fifty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •