Base | Representation |
---|---|
bin | 10110111110010101010010… |
… | …01010001000001101100011 |
3 | 20121212200120121210012112120 |
4 | 23133022221022020031203 |
5 | 23110210424243341011 |
6 | 255240402425355323 |
7 | 13432652504021025 |
oct | 1337125112101543 |
9 | 217780517705476 |
10 | 50520243340131 |
11 | 1510857333a654 |
12 | 57bb1b3338b43 |
13 | 2226066798906 |
14 | c6929b178015 |
15 | 5c9232a79a06 |
hex | 2df2a9288363 |
50520243340131 has 16 divisors (see below), whose sum is σ = 68555112796800. Its totient is φ = 33086444328000.
The previous prime is 50520243340121. The next prime is 50520243340319. The reversal of 50520243340131 is 13104334202505.
It is not a de Polignac number, because 50520243340131 - 213 = 50520243331939 is a prime.
It is a super-2 number, since 2×505202433401312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 50520243340092 and 50520243340101.
It is not an unprimeable number, because it can be changed into a prime (50520243340121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 459478981 + ... + 459588918.
It is an arithmetic number, because the mean of its divisors is an integer number (4284694549800).
Almost surely, 250520243340131 is an apocalyptic number.
50520243340131 is a deficient number, since it is larger than the sum of its proper divisors (18034869456669).
50520243340131 is a wasteful number, since it uses less digits than its factorization.
50520243340131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 919068226.
The product of its (nonzero) digits is 43200, while the sum is 33.
Adding to 50520243340131 its reverse (13104334202505), we get a palindrome (63624577542636).
The spelling of 50520243340131 in words is "fifty trillion, five hundred twenty billion, two hundred forty-three million, three hundred forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •