Base | Representation |
---|---|
bin | 10110111001000111101000… |
… | …01010001100010001001000 |
3 | 20121020120012201111011212102 |
4 | 23130203310022030101020 |
5 | 23044242044413142022 |
6 | 255022215453132532 |
7 | 13414011465313115 |
oct | 1334436412142110 |
9 | 217216181434772 |
10 | 50341113021512 |
11 | 15049600a01a15 |
12 | 5790540a8a148 |
13 | 22121ba093a41 |
14 | c60746a8590c |
15 | 5c474b8aea92 |
hex | 2dc8f428c448 |
50341113021512 has 32 divisors (see below), whose sum is σ = 96403520027520. Its totient is φ = 24633570392640.
The previous prime is 50341113021467. The next prime is 50341113021517. The reversal of 50341113021512 is 21512031114305.
It is a happy number.
It is a super-2 number, since 2×503411130215122 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (50341113021517) 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 7 ways as a sum of consecutive naturals, for example, 2525087 + ... + 10346897.
It is an arithmetic number, because the mean of its divisors is an integer number (3012610000860).
Almost surely, 250341113021512 is an apocalyptic number.
It is an amenable number.
50341113021512 is a deficient number, since it is larger than the sum of its proper divisors (46062407006008).
50341113021512 is a wasteful number, since it uses less digits than its factorization.
50341113021512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7838981 (or 7838977 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 29.
Adding to 50341113021512 its reverse (21512031114305), we get a palindrome (71853144135817).
The spelling of 50341113021512 in words is "fifty trillion, three hundred forty-one billion, one hundred thirteen million, twenty-one thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •