Base | Representation |
---|---|
bin | 101111000011010000… |
… | …011111010101101001 |
3 | 11211101212021022212220 |
4 | 233003100133111221 |
5 | 1311431223120131 |
6 | 35113034024253 |
7 | 3435642222615 |
oct | 570320372551 |
9 | 154355238786 |
10 | 50520520041 |
11 | 1a475575502 |
12 | 995b278089 |
13 | 49c185ab54 |
14 | 2633908345 |
15 | 14aa412e96 |
hex | bc341f569 |
50520520041 has 16 divisors (see below), whose sum is σ = 70920119040. Its totient is φ = 31901340240.
The previous prime is 50520520021. The next prime is 50520520097. The reversal of 50520520041 is 14002502505.
It is a happy number.
It is not a de Polignac number, because 50520520041 - 219 = 50519995753 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 50520519993 and 50520520020.
It is not an unprimeable number, because it can be changed into a prime (50520520021) 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, 209046 + ... + 380448.
It is an arithmetic number, because the mean of its divisors is an integer number (4432507440).
Almost surely, 250520520041 is an apocalyptic number.
It is an amenable number.
50520520041 is a deficient number, since it is larger than the sum of its proper divisors (20399598999).
50520520041 is a wasteful number, since it uses less digits than its factorization.
50520520041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176596.
The product of its (nonzero) digits is 2000, while the sum is 24.
The spelling of 50520520041 in words is "fifty billion, five hundred twenty million, five hundred twenty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •