Base | Representation |
---|---|
bin | 10110111001110010011110… |
… | …00100100001110101101101 |
3 | 20121022202120122012020022110 |
4 | 23130321033010201311231 |
5 | 23100131200423201031 |
6 | 255040542032434233 |
7 | 13415454446621001 |
oct | 1334711704416555 |
9 | 217282518166273 |
10 | 50364113100141 |
11 | 15058333945465 |
12 | 5794a9b6a8979 |
13 | 221441417c919 |
14 | c618c9594701 |
15 | 5c5145bd7c46 |
hex | 2dce4f121d6d |
50364113100141 has 8 divisors (see below), whose sum is σ = 67152544560864. Its totient is φ = 33575878519760.
The previous prime is 50364113100089. The next prime is 50364113100149. The reversal of 50364113100141 is 14100131146305.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 50364113100141 - 211 = 50364113098093 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 50364113100099 and 50364113100108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50364113100149) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48622155 + ... + 49647176.
It is an arithmetic number, because the mean of its divisors is an integer number (8394068070108).
Almost surely, 250364113100141 is an apocalyptic number.
It is an amenable number.
50364113100141 is a deficient number, since it is larger than the sum of its proper divisors (16788431460723).
50364113100141 is a wasteful number, since it uses less digits than its factorization.
50364113100141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98440171.
The product of its (nonzero) digits is 4320, while the sum is 30.
Adding to 50364113100141 its reverse (14100131146305), we get a palindrome (64464244246446).
The spelling of 50364113100141 in words is "fifty trillion, three hundred sixty-four billion, one hundred thirteen million, one hundred thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •