Base | Representation |
---|---|
bin | 101110111000000000… |
… | …110010000011111101 |
3 | 11210220201021001102200 |
4 | 232320000302003331 |
5 | 1311034423244203 |
6 | 35042214142113 |
7 | 3431161456236 |
oct | 567000620375 |
9 | 153821231380 |
10 | 50331853053 |
11 | 1a389023179 |
12 | 9908051939 |
13 | 4991741091 |
14 | 261683608d |
15 | 1498a969a3 |
hex | bb80320fd |
50331853053 has 12 divisors (see below), whose sum is σ = 75046777728. Its totient is φ = 32472163080.
The previous prime is 50331853027. The next prime is 50331853057. The reversal of 50331853053 is 35035813305.
It is a happy number.
It is not a de Polignac number, because 50331853053 - 29 = 50331852541 is a prime.
It is a hoax number, since the sum of its digits (36) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 50331852999 and 50331853017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50331853057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 90200175 + ... + 90200732.
It is an arithmetic number, because the mean of its divisors is an integer number (6253898144).
Almost surely, 250331853053 is an apocalyptic number.
It is an amenable number.
50331853053 is a deficient number, since it is larger than the sum of its proper divisors (24714924675).
50331853053 is a wasteful number, since it uses less digits than its factorization.
50331853053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 180400944 (or 180400941 counting only the distinct ones).
The product of its (nonzero) digits is 81000, while the sum is 36.
The spelling of 50331853053 in words is "fifty billion, three hundred thirty-one million, eight hundred fifty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •