Base | Representation |
---|---|
bin | 10110110010011001001010… |
… | …00011001001100110111110 |
3 | 20120102110200102000112210222 |
4 | 23121030211003021212332 |
5 | 23032000242241301324 |
6 | 254324115110501342 |
7 | 13361220431621261 |
oct | 1331144503114676 |
9 | 216373612015728 |
10 | 50110005025214 |
11 | 14a6a596520772 |
12 | 57537a3364852 |
13 | 21c6478c8c284 |
14 | c534a1338cd8 |
15 | 5bd7223eb55e |
hex | 2d93250c99be |
50110005025214 has 16 divisors (see below), whose sum is σ = 77757399137520. Its totient is φ = 24190882974720.
The previous prime is 50110005025211. The next prime is 50110005025231. The reversal of 50110005025214 is 41252050001105.
50110005025214 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×501100050252142 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50110005025211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6723557 + ... + 12059279.
It is an arithmetic number, because the mean of its divisors is an integer number (4859837446095).
Almost surely, 250110005025214 is an apocalyptic number.
50110005025214 is a deficient number, since it is larger than the sum of its proper divisors (27647394112306).
50110005025214 is a wasteful number, since it uses less digits than its factorization.
50110005025214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5497675.
The product of its (nonzero) digits is 2000, while the sum is 26.
Adding to 50110005025214 its reverse (41252050001105), we get a palindrome (91362055026319).
The spelling of 50110005025214 in words is "fifty trillion, one hundred ten billion, five million, twenty-five thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •