Base | Representation |
---|---|
bin | 10110110010011011001101… |
… | …11110010101101001111101 |
3 | 20120102120112111012221102202 |
4 | 23121031212332111221331 |
5 | 23032010023412410333 |
6 | 254324420541001245 |
7 | 13361260022020616 |
oct | 1331154676255175 |
9 | 216376474187382 |
10 | 50111111060093 |
11 | 14a70003888086 |
12 | 5753a51853225 |
13 | 21c65c4173a95 |
14 | c535681a8c0d |
15 | 5bd7895755e8 |
hex | 2d9366f95a7d |
50111111060093 has 2 divisors, whose sum is σ = 50111111060094. Its totient is φ = 50111111060092.
The previous prime is 50111111060069. The next prime is 50111111060111. The reversal of 50111111060093 is 39006011111105.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 45872960069764 + 4238150990329 = 6772958^2 + 2058677^2 .
It is a cyclic number.
It is not a de Polignac number, because 50111111060093 - 26 = 50111111060029 is a prime.
It is a super-2 number, since 2×501111110600932 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50111111060053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25055555530046 + 25055555530047.
It is an arithmetic number, because the mean of its divisors is an integer number (25055555530047).
Almost surely, 250111111060093 is an apocalyptic number.
It is an amenable number.
50111111060093 is a deficient number, since it is larger than the sum of its proper divisors (1).
50111111060093 is an equidigital number, since it uses as much as digits as its factorization.
50111111060093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 810, while the sum is 29.
Adding to 50111111060093 its reverse (39006011111105), we get a palindrome (89117122171198).
The spelling of 50111111060093 in words is "fifty trillion, one hundred eleven billion, one hundred eleven million, sixty thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •