Base | Representation |
---|---|
bin | 10110110010011111110111… |
… | …10100101010101111111111 |
3 | 20120102210222112021102001122 |
4 | 23121033323310222233333 |
5 | 23032030132213031424 |
6 | 254325512430101155 |
7 | 13361405634326606 |
oct | 1331177364525777 |
9 | 216383875242048 |
10 | 50113608330239 |
11 | 14a71075497103 |
12 | 575442a04a7bb |
13 | 21c690165881c |
14 | c53723b08a3d |
15 | 5bd88391245e |
hex | 2d93fbd2abff |
50113608330239 has 2 divisors, whose sum is σ = 50113608330240. Its totient is φ = 50113608330238.
The previous prime is 50113608330209. The next prime is 50113608330329. The reversal of 50113608330239 is 93203380631105.
Together with next prime (50113608330329) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 50113608330239 - 216 = 50113608264703 is a prime.
It is a super-2 number, since 2×501136083302392 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 50113608330239.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50113608330209) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25056804165119 + 25056804165120.
It is an arithmetic number, because the mean of its divisors is an integer number (25056804165120).
Almost surely, 250113608330239 is an apocalyptic number.
50113608330239 is a deficient number, since it is larger than the sum of its proper divisors (1).
50113608330239 is an equidigital number, since it uses as much as digits as its factorization.
50113608330239 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 349920, while the sum is 44.
The spelling of 50113608330239 in words is "fifty trillion, one hundred thirteen billion, six hundred eight million, three hundred thirty thousand, two hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •