Base | Representation |
---|---|
bin | 10110101111100000101111… |
… | …11010111110011101001011 |
3 | 20120002000010121121010110011 |
4 | 23113300113322332131023 |
5 | 23023340012113441023 |
6 | 254210423024532351 |
7 | 13351114133404306 |
oct | 1327602772763513 |
9 | 216060117533404 |
10 | 50011000530763 |
11 | 14a31601019728 |
12 | 5738572a810b7 |
13 | 21ba02b7a508c |
14 | c4c78c5b5b3d |
15 | 5bad7a7a650d |
hex | 2d7c17ebe74b |
50011000530763 has 2 divisors, whose sum is σ = 50011000530764. Its totient is φ = 50011000530762.
The previous prime is 50011000530707. The next prime is 50011000530811. The reversal of 50011000530763 is 36703500011005.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50011000530763 is a prime.
It is a super-2 number, since 2×500110005307632 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (50011000530703) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25005500265381 + 25005500265382.
It is an arithmetic number, because the mean of its divisors is an integer number (25005500265382).
Almost surely, 250011000530763 is an apocalyptic number.
50011000530763 is a deficient number, since it is larger than the sum of its proper divisors (1).
50011000530763 is an equidigital number, since it uses as much as digits as its factorization.
50011000530763 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9450, while the sum is 31.
Adding to 50011000530763 its reverse (36703500011005), we get a palindrome (86714500541768).
The spelling of 50011000530763 in words is "fifty trillion, eleven billion, five hundred thirty thousand, seven hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •