Base | Representation |
---|---|
bin | 101111000010111011… |
… | …111000000010110011 |
3 | 11211101111002210020001 |
4 | 233002323320002303 |
5 | 1311423332204321 |
6 | 35112322130431 |
7 | 3435545255200 |
oct | 570273700263 |
9 | 154344083201 |
10 | 50515116211 |
11 | 1a47251452a |
12 | 99594b0a17 |
13 | 49c06b8311 |
14 | 2632cdcca7 |
15 | 14a9be6c91 |
hex | bc2ef80b3 |
50515116211 has 12 divisors (see below), whose sum is σ = 60788776320. Its totient is φ = 41805612240.
The previous prime is 50515116167. The next prime is 50515116217. The reversal of 50515116211 is 11261151505.
It is not a de Polignac number, because 50515116211 - 27 = 50515116083 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 50515116211.
It is not an unprimeable number, because it can be changed into a prime (50515116217) 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 11 ways as a sum of consecutive naturals, for example, 17773075 + ... + 17775916.
It is an arithmetic number, because the mean of its divisors is an integer number (5065731360).
Almost surely, 250515116211 is an apocalyptic number.
50515116211 is a deficient number, since it is larger than the sum of its proper divisors (10273660109).
50515116211 is a wasteful number, since it uses less digits than its factorization.
50515116211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35549034 (or 35549027 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 28.
Adding to 50515116211 its reverse (11261151505), we get a palindrome (61776267716).
The spelling of 50515116211 in words is "fifty billion, five hundred fifteen million, one hundred sixteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •