Base | Representation |
---|---|
bin | 10111001000111010010010… |
… | …10001011110110011011101 |
3 | 20200011102202000112211210212 |
4 | 23210131021101132303131 |
5 | 23132134312430000401 |
6 | 300115352514342205 |
7 | 13501140456054602 |
oct | 1344351121366335 |
9 | 220142660484725 |
10 | 50883706875101 |
11 | 15238727aa5001 |
12 | 585972a58a965 |
13 | 225140b794479 |
14 | c7cadab586a9 |
15 | 5d3906a93dbb |
hex | 2e474945ecdd |
50883706875101 has 8 divisors (see below), whose sum is σ = 51040905441240. Its totient is φ = 50726643653952.
The previous prime is 50883706875083. The next prime is 50883706875103. The reversal of 50883706875101 is 10157860738805.
It can be written as a sum of positive squares in 4 ways, for example, as 18208364299876 + 32675342575225 = 4267126^2 + 5716235^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50883706875101 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 (50883706875103) 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, 33083150 + ... + 34587023.
It is an arithmetic number, because the mean of its divisors is an integer number (6380113180155).
Almost surely, 250883706875101 is an apocalyptic number.
It is an amenable number.
50883706875101 is a deficient number, since it is larger than the sum of its proper divisors (157198566139).
50883706875101 is a wasteful number, since it uses less digits than its factorization.
50883706875101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67672495.
The product of its (nonzero) digits is 11289600, while the sum is 59.
The spelling of 50883706875101 in words is "fifty trillion, eight hundred eighty-three billion, seven hundred six million, eight hundred seventy-five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •