Base | Representation |
---|---|
bin | 10110110000010111101111… |
… | …01100000010011011010111 |
3 | 20120011211100012011220222222 |
4 | 23120023313230002123113 |
5 | 23024330443233440111 |
6 | 254232144414212555 |
7 | 13353210563211221 |
oct | 1330136754023327 |
9 | 216154305156888 |
10 | 50040524515031 |
11 | 14a43081598026 |
12 | 57422324b415b |
13 | 21bca55361b5b |
14 | c4dd8d70d411 |
15 | 5bba077037db |
hex | 2d82f7b026d7 |
50040524515031 has 2 divisors, whose sum is σ = 50040524515032. Its totient is φ = 50040524515030.
The previous prime is 50040524515019. The next prime is 50040524515063. The reversal of 50040524515031 is 13051542504005.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 50040524515031 - 210 = 50040524514007 is a prime.
It is a super-2 number, since 2×500405245150312 (a number of 28 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 50040524514982 and 50040524515000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50040524518031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25020262257515 + 25020262257516.
It is an arithmetic number, because the mean of its divisors is an integer number (25020262257516).
Almost surely, 250040524515031 is an apocalyptic number.
50040524515031 is a deficient number, since it is larger than the sum of its proper divisors (1).
50040524515031 is an equidigital number, since it uses as much as digits as its factorization.
50040524515031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60000, while the sum is 35.
The spelling of 50040524515031 in words is "fifty trillion, forty billion, five hundred twenty-four million, five hundred fifteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •