Base | Representation |
---|---|
bin | 10110110010001000011111… |
… | …00110111000110000110101 |
3 | 20120101121120200122110012221 |
4 | 23121010033212320300311 |
5 | 23031323430133010203 |
6 | 254320035044242341 |
7 | 13360452600001105 |
oct | 1331041746706065 |
9 | 216347520573187 |
10 | 50101055360053 |
11 | 14a66813689885 |
12 | 5751b060a03b1 |
13 | 21c5680a83909 |
14 | c52c928a7205 |
15 | 5bd39b863abd |
hex | 2d910f9b8c35 |
50101055360053 has 16 divisors (see below), whose sum is σ = 50992696419840. Its totient is φ = 49214880514800.
The previous prime is 50101055360023. The next prime is 50101055360071. The reversal of 50101055360053 is 35006355010105.
50101055360053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 50101055360053 - 29 = 50101055359541 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50101055360003) 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 15 ways as a sum of consecutive naturals, for example, 22342498 + ... + 24482428.
It is an arithmetic number, because the mean of its divisors is an integer number (3187043526240).
Almost surely, 250101055360053 is an apocalyptic number.
It is an amenable number.
50101055360053 is a deficient number, since it is larger than the sum of its proper divisors (891641059787).
50101055360053 is a wasteful number, since it uses less digits than its factorization.
50101055360053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2141208.
The product of its (nonzero) digits is 33750, while the sum is 34.
The spelling of 50101055360053 in words is "fifty trillion, one hundred one billion, fifty-five million, three hundred sixty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •