Base | Representation |
---|---|
bin | 101111000011000001… |
… | …101110111010001101 |
3 | 11211101120222210110120 |
4 | 233003001232322031 |
5 | 1311424230323121 |
6 | 35112415055153 |
7 | 3435564311550 |
oct | 570301567215 |
9 | 154346883416 |
10 | 50516651661 |
11 | 1a4733730a3 |
12 | 9959b114b9 |
13 | 49c0b05178 |
14 | 26331bc697 |
15 | 14a9debbc6 |
hex | bc306ee8d |
50516651661 has 16 divisors (see below), whose sum is σ = 77014812288. Its totient is φ = 28852761600.
The previous prime is 50516651639. The next prime is 50516651683. The reversal of 50516651661 is 16615661505.
It is an interprime number because it is at equal distance from previous prime (50516651639) and next prime (50516651683).
It is not a de Polignac number, because 50516651661 - 27 = 50516651533 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50516653661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 534280 + ... + 621681.
It is an arithmetic number, because the mean of its divisors is an integer number (4813425768).
Almost surely, 250516651661 is an apocalyptic number.
It is an amenable number.
50516651661 is a deficient number, since it is larger than the sum of its proper divisors (26498160627).
50516651661 is a wasteful number, since it uses less digits than its factorization.
50516651661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1158052.
The product of its (nonzero) digits is 162000, while the sum is 42.
The spelling of 50516651661 in words is "fifty billion, five hundred sixteen million, six hundred fifty-one thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •