Base | Representation |
---|---|
bin | 101111001011111110… |
… | …101110010010111001 |
3 | 11211210001122001100121 |
4 | 233023332232102321 |
5 | 1312231203421112 |
6 | 35135342333241 |
7 | 3442400120113 |
oct | 571376562271 |
9 | 154701561317 |
10 | 50666857657 |
11 | 1a540136089 |
12 | 99a028a221 |
13 | 4a15c76a60 |
14 | 264911c3b3 |
15 | 14b81bc407 |
hex | bcbfae4b9 |
50666857657 has 8 divisors (see below), whose sum is σ = 54585163080. Its totient is φ = 46751531520.
The previous prime is 50666857643. The next prime is 50666857663. The reversal of 50666857657 is 75675866605.
It can be written as a sum of positive squares in 4 ways, for example, as 5187456576 + 45479401081 = 72024^2 + 213259^2 .
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 50666857657 - 231 = 48519374009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50666857595 and 50666857604.
It is not an unprimeable number, because it can be changed into a prime (50666857607) 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, 709432 + ... + 777577.
It is an arithmetic number, because the mean of its divisors is an integer number (6823145385).
Almost surely, 250666857657 is an apocalyptic number.
It is an amenable number.
50666857657 is a deficient number, since it is larger than the sum of its proper divisors (3918305423).
50666857657 is a wasteful number, since it uses less digits than its factorization.
50666857657 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1489643.
The product of its (nonzero) digits is 63504000, while the sum is 61.
The spelling of 50666857657 in words is "fifty billion, six hundred sixty-six million, eight hundred fifty-seven thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •