Base | Representation |
---|---|
bin | 101110100110000010… |
… | …010000111111101011 |
3 | 11210010200202010120201 |
4 | 232212002100333223 |
5 | 1304430221031021 |
6 | 34552241533031 |
7 | 3420540061015 |
oct | 564602207753 |
9 | 153120663521 |
10 | 50030252011 |
11 | 1a243855913 |
12 | 9843044177 |
13 | 494410261c |
14 | 25c87671b5 |
15 | 147c36d591 |
hex | ba6090feb |
50030252011 has 4 divisors (see below), whose sum is σ = 50039861800. Its totient is φ = 50020642224.
The previous prime is 50030252003. The next prime is 50030252053. The reversal of 50030252011 is 11025203005.
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 50030252011 - 23 = 50030252003 is a prime.
It is a super-2 number, since 2×500302520112 (a number of 22 digits) contains 22 as substring.
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 50030252011.
It is not an unprimeable number, because it can be changed into a prime (50030252611) 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 3 ways as a sum of consecutive naturals, for example, 4797081 + ... + 4807498.
It is an arithmetic number, because the mean of its divisors is an integer number (12509965450).
Almost surely, 250030252011 is an apocalyptic number.
50030252011 is a deficient number, since it is larger than the sum of its proper divisors (9609789).
50030252011 is an equidigital number, since it uses as much as digits as its factorization.
50030252011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9609788.
The product of its (nonzero) digits is 300, while the sum is 19.
Adding to 50030252011 its reverse (11025203005), we get a palindrome (61055455016).
The spelling of 50030252011 in words is "fifty billion, thirty million, two hundred fifty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •