Base | Representation |
---|---|
bin | 10111000001100101110100… |
… | …10110110000000001101111 |
3 | 20122021101120010220011220122 |
4 | 23200302322112300001233 |
5 | 23114024221424330221 |
6 | 255404040111035155 |
7 | 13444025066355443 |
oct | 1340627226600157 |
9 | 218241503804818 |
10 | 50632201011311 |
11 | 15150aa5546027 |
12 | 5818a3980babb |
13 | 223379973c31a |
14 | c7087c358823 |
15 | 5cc0d6972eab |
hex | 2e0cba5b006f |
50632201011311 has 4 divisors (see below), whose sum is σ = 50664678370800. Its totient is φ = 50599723651824.
The previous prime is 50632201011277. The next prime is 50632201011317. The reversal of 50632201011311 is 11311010223605.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 50632201011311 - 214 = 50632200994927 is a prime.
It is a super-2 number, since 2×506322010113112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50632201011317) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16238677406 + ... + 16238680523.
It is an arithmetic number, because the mean of its divisors is an integer number (12666169592700).
Almost surely, 250632201011311 is an apocalyptic number.
50632201011311 is a deficient number, since it is larger than the sum of its proper divisors (32477359489).
50632201011311 is a wasteful number, since it uses less digits than its factorization.
50632201011311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32477359488.
The product of its (nonzero) digits is 1080, while the sum is 26.
Adding to 50632201011311 its reverse (11311010223605), we get a palindrome (61943211234916).
The spelling of 50632201011311 in words is "fifty trillion, six hundred thirty-two billion, two hundred one million, eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •