Base | Representation |
---|---|
bin | 10110101111100000011100… |
… | …11110101111000100001011 |
3 | 20120001222201120112200012222 |
4 | 23113300032132233010023 |
5 | 23023334201041221442 |
6 | 254210355205524255 |
7 | 13351110201136436 |
oct | 1327601636570413 |
9 | 216058646480188 |
10 | 50010842132747 |
11 | 14a3152a670981 |
12 | 5738529a1368b |
13 | 21ba004a25842 |
14 | c4c77554281d |
15 | 5bad6b9188d2 |
hex | 2d7c0e7af10b |
50010842132747 has 4 divisors (see below), whose sum is σ = 50019433590576. Its totient is φ = 50002250674920.
The previous prime is 50010842132729. The next prime is 50010842132753. The reversal of 50010842132747 is 74723124801005.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 50010842132747 - 228 = 50010573697291 is a prime.
It is a super-3 number, since 3×500108421327473 (a number of 42 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50010842132698 and 50010842132707.
It is not an unprimeable number, because it can be changed into a prime (50010842102747) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4295720183 + ... + 4295731824.
It is an arithmetic number, because the mean of its divisors is an integer number (12504858397644).
Almost surely, 250010842132747 is an apocalyptic number.
50010842132747 is a deficient number, since it is larger than the sum of its proper divisors (8591457829).
50010842132747 is an equidigital number, since it uses as much as digits as its factorization.
50010842132747 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8591457828.
The product of its (nonzero) digits is 376320, while the sum is 44.
The spelling of 50010842132747 in words is "fifty trillion, ten billion, eight hundred forty-two million, one hundred thirty-two thousand, seven hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •