Base | Representation |
---|---|
bin | 101111000011000011… |
… | …001101111100100011 |
3 | 11211101121201120102222 |
4 | 233003003031330203 |
5 | 1311424330302211 |
6 | 35112431301255 |
7 | 3435600522500 |
oct | 570303157443 |
9 | 154347646388 |
10 | 50517040931 |
11 | 1a473609605 |
12 | 995a07a82b |
13 | 49c0c103c6 |
14 | 26332804a7 |
15 | 14a9e771db |
hex | bc30cdf23 |
50517040931 has 24 divisors (see below), whose sum is σ = 62238637440. Its totient is φ = 40741999872.
The previous prime is 50517040891. The next prime is 50517040939. The reversal of 50517040931 is 13904071505.
It is a de Polignac number, because none of the positive numbers 2k-50517040931 is a prime.
It is a super-2 number, since 2×505170409312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 50517040891 and 50517040900.
It is not an unprimeable number, because it can be changed into a prime (50517040939) 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 23 ways as a sum of consecutive naturals, for example, 4416686 + ... + 4428108.
It is an arithmetic number, because the mean of its divisors is an integer number (2593276560).
Almost surely, 250517040931 is an apocalyptic number.
50517040931 is a deficient number, since it is larger than the sum of its proper divisors (11721596509).
50517040931 is a wasteful number, since it uses less digits than its factorization.
50517040931 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16763 (or 16756 counting only the distinct ones).
The product of its (nonzero) digits is 18900, while the sum is 35.
The spelling of 50517040931 in words is "fifty billion, five hundred seventeen million, forty thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •